./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer --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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer --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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ............................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:23:39,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:23:39,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:23:39,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:23:39,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:23:39,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:23:39,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:23:39,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:23:39,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:23:39,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:23:39,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:23:39,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:23:39,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:23:39,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:23:39,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:23:39,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:23:39,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:23:39,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:23:39,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:23:39,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:23:39,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:23:39,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:23:39,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:23:39,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:23:39,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:23:39,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:23:39,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:23:39,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:23:39,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:23:39,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:23:39,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:23:39,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:23:39,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:23:39,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:23:39,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:23:39,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:23:39,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:23:39,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:23:39,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:23:39,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:23:39,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:23:39,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 18:23:39,744 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:23:39,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:23:39,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:23:39,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:23:39,748 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:23:39,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:23:39,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:23:39,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:23:39,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:23:39,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:23:39,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:23:39,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:23:39,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:23:39,751 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:23:39,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:23:39,751 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:23:39,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:23:39,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:23:39,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:23:39,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:23:39,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:23:39,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:23:39,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:23:39,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:23:39,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:23:39,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:23:39,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:23:39,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:23:39,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:23:39,754 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:/tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-11-29 18:23:40,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:23:40,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:23:40,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:23:40,078 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:23:40,079 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:23:40,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-29 18:23:40,172 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/625bbda47/2042b9c6037a43748444d2c71d1fbaae/FLAG374e1b5fa [2020-11-29 18:23:40,699 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:23:40,699 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-29 18:23:40,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/625bbda47/2042b9c6037a43748444d2c71d1fbaae/FLAG374e1b5fa [2020-11-29 18:23:41,065 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/625bbda47/2042b9c6037a43748444d2c71d1fbaae [2020-11-29 18:23:41,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:23:41,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:23:41,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:23:41,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:23:41,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:23:41,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec6254c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41, skipping insertion in model container [2020-11-29 18:23:41,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:23:41,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:23:41,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:23:41,348 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:23:41,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:23:41,399 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:23:41,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41 WrapperNode [2020-11-29 18:23:41,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:23:41,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:23:41,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:23:41,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:23:41,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:23:41,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:23:41,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:23:41,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:23:41,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... [2020-11-29 18:23:41,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:23:41,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:23:41,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:23:41,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:23:41,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:23:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:23:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:23:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:23:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:23:41,766 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:23:41,766 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-29 18:23:41,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:41 BoogieIcfgContainer [2020-11-29 18:23:41,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:23:41,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:23:41,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:23:41,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:23:41,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:23:41" (1/3) ... [2020-11-29 18:23:41,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ecc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:41, skipping insertion in model container [2020-11-29 18:23:41,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:41" (2/3) ... [2020-11-29 18:23:41,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ecc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:41, skipping insertion in model container [2020-11-29 18:23:41,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:41" (3/3) ... [2020-11-29 18:23:41,779 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-11-29 18:23:41,791 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:23:41,795 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 18:23:41,809 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 18:23:41,847 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:23:41,868 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:23:41,868 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:23:41,868 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:23:41,868 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:23:41,869 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:23:41,869 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:23:41,869 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:23:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-11-29 18:23:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:23:41,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:23:41,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:23:41,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:23:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:23:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-11-29 18:23:41,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:23:41,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302415009] [2020-11-29 18:23:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:23:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:23:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:23:42,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302415009] [2020-11-29 18:23:42,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:23:42,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 18:23:42,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461478960] [2020-11-29 18:23:42,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 18:23:42,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:23:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 18:23:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 18:23:42,123 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-11-29 18:23:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:23:42,140 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-11-29 18:23:42,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 18:23:42,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-11-29 18:23:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:23:42,157 INFO L225 Difference]: With dead ends: 22 [2020-11-29 18:23:42,157 INFO L226 Difference]: Without dead ends: 8 [2020-11-29 18:23:42,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 18:23:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-29 18:23:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-29 18:23:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-29 18:23:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-29 18:23:42,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-11-29 18:23:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:23:42,210 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-29 18:23:42,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 18:23:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-29 18:23:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:23:42,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:23:42,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:23:42,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 18:23:42,213 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:23:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:23:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-11-29 18:23:42,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:23:42,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094645064] [2020-11-29 18:23:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:23:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:23:42,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:23:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:23:42,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:23:42,318 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:23:42,318 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:23:42,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 18:23:42,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:23:42 BoogieIcfgContainer [2020-11-29 18:23:42,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:23:42,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:23:42,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:23:42,350 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:23:42,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:41" (3/4) ... [2020-11-29 18:23:42,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 18:23:42,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:23:42,357 INFO L168 Benchmark]: Toolchain (without parser) took 1286.01 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 58.9 MB in the beginning and 50.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:23:42,357 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:23:42,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.90 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 58.6 MB in the beginning and 84.7 MB in the end (delta: -26.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:23:42,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 107.0 MB. Free memory was 84.7 MB in the beginning and 83.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:23:42,360 INFO L168 Benchmark]: Boogie Preprocessor took 21.48 ms. Allocated memory is still 107.0 MB. Free memory was 83.3 MB in the beginning and 82.7 MB in the end (delta: 686.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:23:42,361 INFO L168 Benchmark]: RCFGBuilder took 297.84 ms. Allocated memory is still 107.0 MB. Free memory was 82.1 MB in the beginning and 71.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:23:42,362 INFO L168 Benchmark]: TraceAbstraction took 577.98 ms. Allocated memory is still 107.0 MB. Free memory was 70.8 MB in the beginning and 50.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:23:42,362 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 107.0 MB. Free memory was 50.8 MB in the beginning and 50.3 MB in the end (delta: 423.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:23:42,367 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory is still 45.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 330.90 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 58.6 MB in the beginning and 84.7 MB in the end (delta: -26.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 107.0 MB. Free memory was 84.7 MB in the beginning and 83.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.48 ms. Allocated memory is still 107.0 MB. Free memory was 83.3 MB in the beginning and 82.7 MB in the end (delta: 686.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 297.84 ms. Allocated memory is still 107.0 MB. Free memory was 82.1 MB in the beginning and 71.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 577.98 ms. Allocated memory is still 107.0 MB. Free memory was 70.8 MB in the beginning and 50.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Witness Printer took 4.91 ms. Allocated memory is still 107.0 MB. Free memory was 50.8 MB in the beginning and 50.3 MB in the end (delta: 423.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L3] __assert_fail("0", "sqrt_poly.c", 3, "reach_error") VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:23:45,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:23:45,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:23:45,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:23:45,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:23:45,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:23:45,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:23:45,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:23:45,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:23:45,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:23:45,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:23:45,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:23:45,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:23:45,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:23:45,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:23:45,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:23:45,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:23:45,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:23:45,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:23:45,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:23:45,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:23:45,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:23:45,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:23:45,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:23:45,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:23:45,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:23:45,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:23:45,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:23:45,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:23:45,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:23:45,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:23:45,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:23:45,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:23:45,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:23:45,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:23:45,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:23:45,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:23:45,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:23:45,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:23:45,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:23:45,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:23:45,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 18:23:45,355 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:23:45,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:23:45,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:23:45,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:23:45,359 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:23:45,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:23:45,360 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:23:45,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:23:45,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:23:45,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:23:45,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:23:45,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:23:45,362 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 18:23:45,362 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 18:23:45,363 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:23:45,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:23:45,363 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:23:45,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:23:45,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:23:45,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:23:45,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:23:45,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:23:45,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:23:45,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:23:45,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:23:45,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:23:45,365 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 18:23:45,366 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 18:23:45,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:23:45,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:23:45,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 18:23:45,366 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:/tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-11-29 18:23:45,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:23:45,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:23:45,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:23:45,858 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:23:45,858 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:23:45,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-29 18:23:45,952 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/4a7ec16c2/7fb63236978b4b85b4af36d90f22e239/FLAGbcb3634d3 [2020-11-29 18:23:46,597 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:23:46,598 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-29 18:23:46,606 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/4a7ec16c2/7fb63236978b4b85b4af36d90f22e239/FLAGbcb3634d3 [2020-11-29 18:23:46,961 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/data/4a7ec16c2/7fb63236978b4b85b4af36d90f22e239 [2020-11-29 18:23:46,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:23:46,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:23:46,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:23:46,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:23:46,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:23:46,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:46" (1/1) ... [2020-11-29 18:23:46,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d0e922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:46, skipping insertion in model container [2020-11-29 18:23:46,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:23:46" (1/1) ... [2020-11-29 18:23:46,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:23:46,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:23:47,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:23:47,185 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:23:47,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:23:47,222 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:23:47,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47 WrapperNode [2020-11-29 18:23:47,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:23:47,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:23:47,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:23:47,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:23:47,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:23:47,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:23:47,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:23:47,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:23:47,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... [2020-11-29 18:23:47,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:23:47,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:23:47,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:23:47,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:23:47,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:23:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 18:23:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:23:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:23:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:23:52,163 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:23:52,163 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-29 18:23:52,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:52 BoogieIcfgContainer [2020-11-29 18:23:52,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:23:52,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:23:52,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:23:52,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:23:52,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:23:46" (1/3) ... [2020-11-29 18:23:52,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d942d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:52, skipping insertion in model container [2020-11-29 18:23:52,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:23:47" (2/3) ... [2020-11-29 18:23:52,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d942d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:23:52, skipping insertion in model container [2020-11-29 18:23:52,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:52" (3/3) ... [2020-11-29 18:23:52,181 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-11-29 18:23:52,199 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:23:52,211 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 18:23:52,236 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 18:23:52,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:23:52,265 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:23:52,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:23:52,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:23:52,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:23:52,266 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:23:52,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:23:52,266 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:23:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-11-29 18:23:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:23:52,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:23:52,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:23:52,302 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:23:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:23:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-11-29 18:23:52,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:23:52,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200831629] [2020-11-29 18:23:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-29 18:23:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:23:53,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-29 18:23:53,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:23:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:23:53,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:23:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:23:53,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200831629] [2020-11-29 18:23:53,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:23:53,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-29 18:23:53,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013485851] [2020-11-29 18:23:53,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 18:23:53,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:23:53,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 18:23:53,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 18:23:53,585 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-11-29 18:23:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:23:53,602 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-11-29 18:23:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 18:23:53,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-11-29 18:23:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:23:53,614 INFO L225 Difference]: With dead ends: 22 [2020-11-29 18:23:53,615 INFO L226 Difference]: Without dead ends: 8 [2020-11-29 18:23:53,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 18:23:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-29 18:23:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-29 18:23:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-29 18:23:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-29 18:23:53,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-11-29 18:23:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:23:53,656 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-29 18:23:53,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 18:23:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-29 18:23:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:23:53,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:23:53,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:23:53,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 18:23:53,873 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:23:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:23:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-11-29 18:23:53,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:23:53,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751854646] [2020-11-29 18:23:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-29 18:23:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:23:56,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 18:23:56,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:23:56,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:23:58,572 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-11-29 18:23:58,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 18:24:00,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 18:24:15,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq .cse2 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse2 .cse1)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and .cse7 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2020-11-29 18:24:26,399 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from false [2020-11-29 18:24:28,520 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from true [2020-11-29 18:24:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:24:28,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:24:30,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2020-11-29 18:24:33,038 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2020-11-29 18:24:35,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-11-29 18:24:37,410 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-11-29 18:24:37,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 18:24:37,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 18:24:37,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-29 18:24:39,556 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-11-29 18:24:41,937 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-11-29 18:24:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:24:41,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751854646] [2020-11-29 18:24:41,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:24:41,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-11-29 18:24:41,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17536445] [2020-11-29 18:24:41,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 18:24:41,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:24:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 18:24:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-11-29 18:24:41,944 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2020-11-29 18:24:44,099 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-11-29 18:24:46,454 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-11-29 18:24:48,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from false [2020-11-29 18:24:50,759 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from true [2020-11-29 18:24:52,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-11-29 18:24:55,093 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-11-29 18:24:57,224 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-11-29 18:24:59,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.geq .cse3 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))))) is different from false [2020-11-29 18:24:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:24:59,416 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-11-29 18:24:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:24:59,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-11-29 18:24:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:24:59,418 INFO L225 Difference]: With dead ends: 12 [2020-11-29 18:24:59,418 INFO L226 Difference]: Without dead ends: 8 [2020-11-29 18:24:59,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-11-29 18:24:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-29 18:24:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-29 18:24:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-29 18:24:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-11-29 18:24:59,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-11-29 18:24:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:24:59,423 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-11-29 18:24:59,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 18:24:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-11-29 18:24:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:24:59,424 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:24:59,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:24:59,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-29 18:24:59,640 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:24:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:24:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2020-11-29 18:24:59,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:24:59,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307877773] [2020-11-29 18:24:59,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-29 18:25:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:25:08,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 18:25:08,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:25:08,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:25:10,540 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-11-29 18:25:10,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 18:25:14,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 18:25:28,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse1)) (fp.geq .cse0 .cse2) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (not (fp.leq (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7))) is different from false [2020-11-29 18:25:39,217 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from false [2020-11-29 18:25:41,362 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from true [2020-11-29 18:25:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:25:41,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:25:43,628 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-11-29 18:25:45,784 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-11-29 18:25:47,945 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-11-29 18:25:50,105 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-11-29 18:25:50,117 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 18:25:50,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 18:25:50,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-29 18:25:52,249 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-11-29 18:25:54,546 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-11-29 18:25:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:25:54,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307877773] [2020-11-29 18:25:54,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:25:54,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-11-29 18:25:54,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250988505] [2020-11-29 18:25:54,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 18:25:54,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:25:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 18:25:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-11-29 18:25:54,551 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 13 states. [2020-11-29 18:25:56,688 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-11-29 18:25:58,975 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-11-29 18:26:01,130 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from false [2020-11-29 18:26:03,287 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from true [2020-11-29 18:26:05,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-11-29 18:26:07,615 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-11-29 18:26:09,772 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2020-11-29 18:26:37,408 WARN L193 SmtUtils]: Spent 16.92 s on a formula simplification. DAG size of input: 48 DAG size of output: 5 [2020-11-29 18:26:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:26:37,410 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-11-29 18:26:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:26:37,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-11-29 18:26:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:26:37,410 INFO L225 Difference]: With dead ends: 8 [2020-11-29 18:26:37,410 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 18:26:37,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=36, Invalid=39, Unknown=21, NotChecked=210, Total=306 [2020-11-29 18:26:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 18:26:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 18:26:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 18:26:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 18:26:37,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-11-29 18:26:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:26:37,414 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 18:26:37,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 18:26:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 18:26:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 18:26:37,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-29 18:26:37,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 18:26:37,668 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L277 CegarLoopResult]: At program point L31(lines 20 32) the Hoare annotation is: true [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point L13(lines 27 28) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 18:26:37,669 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 18:26:37,670 INFO L274 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-11-29 18:26:37,670 INFO L274 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-11-29 18:26:37,670 INFO L274 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-11-29 18:26:37,670 INFO L277 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: true [2020-11-29 18:26:37,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:26:37 BoogieIcfgContainer [2020-11-29 18:26:37,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:26:37,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:26:37,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:26:37,679 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:26:37,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:23:52" (3/4) ... [2020-11-29 18:26:37,683 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 18:26:37,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-29 18:26:37,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-29 18:26:37,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 18:26:37,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 18:26:37,751 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b58cb1d0-8900-4182-9024-26604e19b092/bin/uautomizer/witness.graphml [2020-11-29 18:26:37,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:26:37,758 INFO L168 Benchmark]: Toolchain (without parser) took 170791.42 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 40.1 MB in the beginning and 30.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,758 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 43.2 MB in the end (delta: 43.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:26:37,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.95 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 29.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 60.8 MB. Free memory was 29.6 MB in the beginning and 45.0 MB in the end (delta: -15.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,766 INFO L168 Benchmark]: Boogie Preprocessor took 45.20 ms. Allocated memory is still 60.8 MB. Free memory was 45.0 MB in the beginning and 43.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:26:37,767 INFO L168 Benchmark]: RCFGBuilder took 4820.11 ms. Allocated memory is still 60.8 MB. Free memory was 43.7 MB in the beginning and 32.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,772 INFO L168 Benchmark]: TraceAbstraction took 165511.14 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 31.8 MB in the beginning and 32.3 MB in the end (delta: -470.3 kB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,773 INFO L168 Benchmark]: Witness Printer took 76.78 ms. Allocated memory is still 75.5 MB. Free memory was 32.3 MB in the beginning and 30.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:26:37,776 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 43.2 MB in the end (delta: 43.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 256.95 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 29.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 60.8 MB. Free memory was 29.6 MB in the beginning and 45.0 MB in the end (delta: -15.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.20 ms. Allocated memory is still 60.8 MB. Free memory was 45.0 MB in the beginning and 43.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4820.11 ms. Allocated memory is still 60.8 MB. Free memory was 43.7 MB in the beginning and 32.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 165511.14 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 31.8 MB in the beginning and 32.3 MB in the end (delta: -470.3 kB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. * Witness Printer took 76.78 ms. Allocated memory is still 75.5 MB. Free memory was 32.3 MB in the beginning and 30.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 165.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 60.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 12 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 105.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 11.6s SatisfiabilityAnalysisTime, 92.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 10554 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...