./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80e6cba3a638c96413a46f146860cf66cd7d52ab ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80e6cba3a638c96413a46f146860cf66cd7d52ab ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:41:29,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:41:29,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:41:29,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:41:29,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:41:29,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:41:29,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:41:29,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:41:29,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:41:29,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:41:29,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:41:29,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:41:29,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:41:29,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:41:29,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:41:29,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:41:29,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:41:29,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:41:29,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:41:29,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:41:29,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:41:29,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:41:29,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:41:29,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:41:29,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:41:29,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:41:29,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:41:29,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:41:29,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:41:29,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:41:29,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:41:29,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:41:29,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:41:29,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:41:29,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:41:29,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:41:29,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:41:29,762 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:41:29,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:41:29,763 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:41:29,763 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:41:29,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:41:29,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:41:29,764 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:41:29,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:41:29,764 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:41:29,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:41:29,764 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:41:29,765 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:41:29,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:41:29,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:41:29,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:41:29,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:41:29,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:41:29,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:29,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:41:29,767 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/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(__VERIFIER_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 -> 80e6cba3a638c96413a46f146860cf66cd7d52ab [2018-11-22 21:41:29,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:41:29,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:41:29,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:41:29,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:41:29,800 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:41:29,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:29,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/6f4798cb3/12ee38243b1e46c8bea95611a8d53110/FLAG4dd88cfa9 [2018-11-22 21:41:30,237 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:41:30,238 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:30,242 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/6f4798cb3/12ee38243b1e46c8bea95611a8d53110/FLAG4dd88cfa9 [2018-11-22 21:41:30,252 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/6f4798cb3/12ee38243b1e46c8bea95611a8d53110 [2018-11-22 21:41:30,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:41:30,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:41:30,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:30,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:41:30,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:41:30,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30, skipping insertion in model container [2018-11-22 21:41:30,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:41:30,277 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:41:30,384 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:30,386 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:41:30,398 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:30,405 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:41:30,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30 WrapperNode [2018-11-22 21:41:30,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:30,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:30,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:41:30,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:41:30,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:30,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:41:30,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:41:30,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:41:30,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... [2018-11-22 21:41:30,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:41:30,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:41:30,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:41:30,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:41:30,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/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 [2018-11-22 21:41:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:41:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:41:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-22 21:41:30,501 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-22 21:41:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:41:30,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:41:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-22 21:41:30,501 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-22 21:41:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:41:30,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:41:30,580 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:41:30,580 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 21:41:30,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:30 BoogieIcfgContainer [2018-11-22 21:41:30,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:41:30,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:41:30,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:41:30,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:41:30,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:30" (1/3) ... [2018-11-22 21:41:30,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2b8f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:30, skipping insertion in model container [2018-11-22 21:41:30,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:30" (2/3) ... [2018-11-22 21:41:30,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2b8f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:30, skipping insertion in model container [2018-11-22 21:41:30,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:30" (3/3) ... [2018-11-22 21:41:30,586 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:30,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:41:30,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:41:30,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:41:30,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:41:30,635 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:41:30,635 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:41:30,635 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:41:30,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:41:30,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:41:30,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:41:30,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:41:30,636 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:41:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-22 21:41:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:41:30,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:30,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:30,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-22 21:41:30,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:41:30,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:41:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:30,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:30,742 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [main_~IN~0=2.0] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=2.0] [?] ~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [f_~x=2.0, |f_#in~x|=2.0] [?] assume true; VAL [f_~x=2.0, |f_#in~x|=2.0] [?] RET #27#return; VAL [main_~IN~0=2.0, |main_#t~ret2|=1.0] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=2.0] [?] ~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [fp_~x=2.0, |fp_#in~x|=2.0] [?] assume true; VAL [fp_~x=2.0, |fp_#in~x|=2.0] [?] RET #29#return; VAL [main_~IN~0=2.0, |main_#t~ret2|=1.0, |main_#t~ret3|=0.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3; VAL [main_~IN~0=2.0] [?] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [main_~IN~0=2.0] [?] assume !false; VAL [main_~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L4-L7] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L9-L12] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L4-L7] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L9-L12] ensures true; VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(0.8)) && ~someBinaryFLOATComparisonOperation(~IN~0, 0.8) then 1 else 0); VAL [~IN~0=2.0] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=2.0] [L4-L7] ~x := #in~x; [L6] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=1.0, ~IN~0=2.0] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=2.0] [L9-L12] ~x := #in~x; [L11] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0)); VAL [#in~x=2.0, ~x=2.0] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=1.0, #t~ret3=0.0, ~IN~0=2.0] [L19] ~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=2] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR f(IN) VAL [f(IN)=1, IN=2] [L19] CALL, EXPR fp(IN) VAL [\old(x)=2] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR fp(IN) VAL [f(IN)=1, fp(IN)=0, IN=2] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=2] [L28] __VERIFIER_error() VAL [IN=2] ----- [2018-11-22 21:41:30,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:41:30 BoogieIcfgContainer [2018-11-22 21:41:30,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:41:30,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:41:30,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:41:30,762 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:41:30,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:30" (3/4) ... [2018-11-22 21:41:30,765 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:41:30,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:41:30,766 INFO L168 Benchmark]: Toolchain (without parser) took 511.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:30,767 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:30,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.67 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:30,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.04 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:30,769 INFO L168 Benchmark]: Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:30,770 INFO L168 Benchmark]: RCFGBuilder took 151.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:30,770 INFO L168 Benchmark]: TraceAbstraction took 179.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:30,771 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:30,774 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.67 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.04 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 151.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 28]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 17, overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticFLOAToperation at line 19. Possible FailurePath: [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=2] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR f(IN) VAL [f(IN)=1, IN=2] [L19] CALL, EXPR fp(IN) VAL [\old(x)=2] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR fp(IN) VAL [f(IN)=1, fp(IN)=0, IN=2] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=2] [L28] __VERIFIER_error() VAL [IN=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.1.23-aa41828 [2018-11-22 21:41:32,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:41:32,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:41:32,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:41:32,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:41:32,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:41:32,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:41:32,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:41:32,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:41:32,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:41:32,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:41:32,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:41:32,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:41:32,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:41:32,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:41:32,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:41:32,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:41:32,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:41:32,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:41:32,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:41:32,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:41:32,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:41:32,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:41:32,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:41:32,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:41:32,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:41:32,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:41:32,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:41:32,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:41:32,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:41:32,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:41:32,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:41:32,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:41:32,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:41:32,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:41:32,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:41:32,232 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 21:41:32,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:41:32,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:41:32,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:41:32,243 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:41:32,243 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:41:32,243 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:41:32,243 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:41:32,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:41:32,244 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:41:32,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:41:32,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:32,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:41:32,246 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:41:32,247 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:41:32,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/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(__VERIFIER_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 -> 80e6cba3a638c96413a46f146860cf66cd7d52ab [2018-11-22 21:41:32,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:41:32,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:41:32,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:41:32,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:41:32,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:41:32,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:32,329 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/502e7de0a/e6859860f56840649058a0d482c6f30c/FLAG58193a961 [2018-11-22 21:41:32,716 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:41:32,716 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/sv-benchmarks/c/floats-cdfpl/newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:32,720 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/502e7de0a/e6859860f56840649058a0d482c6f30c/FLAG58193a961 [2018-11-22 21:41:32,727 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/data/502e7de0a/e6859860f56840649058a0d482c6f30c [2018-11-22 21:41:32,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:41:32,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:41:32,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:32,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:41:32,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:41:32,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e7d3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32, skipping insertion in model container [2018-11-22 21:41:32,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:41:32,756 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:41:32,877 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:32,880 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:41:32,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:32,903 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:41:32,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32 WrapperNode [2018-11-22 21:41:32,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:32,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:32,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:41:32,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:41:32,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:32,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:41:32,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:41:32,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:41:32,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... [2018-11-22 21:41:32,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:41:32,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:41:32,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:41:32,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:41:32,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/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 [2018-11-22 21:41:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:41:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-22 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-22 21:41:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:41:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-22 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-22 21:41:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:41:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:41:38,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:41:38,196 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 21:41:38,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:38 BoogieIcfgContainer [2018-11-22 21:41:38,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:41:38,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:41:38,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:41:38,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:41:38,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:32" (1/3) ... [2018-11-22 21:41:38,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527febd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:38, skipping insertion in model container [2018-11-22 21:41:38,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:32" (2/3) ... [2018-11-22 21:41:38,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527febd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:38, skipping insertion in model container [2018-11-22 21:41:38,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:38" (3/3) ... [2018-11-22 21:41:38,203 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_4_false-unreach-call_true-termination.i [2018-11-22 21:41:38,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:41:38,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:41:38,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:41:38,256 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:41:38,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:41:38,257 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:41:38,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:41:38,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:41:38,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:41:38,257 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:41:38,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:41:38,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:41:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-22 21:41:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:41:38,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:38,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:38,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:38,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-22 21:41:38,287 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:41:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/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 [2018-11-22 21:41:38,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:41:53,694 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [f_~x=(fp #b1 #b01111110 #b01100101011111000110101), |f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |f_#res|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01100101011111000110101), |f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |f_#res|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), |main_#t~ret2|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [fp_~x=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#res|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#res|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), |main_#t~ret2|=(fp #b1 #b01111110 #b01001001001010000000000), |main_#t~ret3|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.6982148289680481] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.6982148289680481, \result=-0.64288330078125, x=-0.6982148289680481] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.64288330078125, IN=-0.6982148289680481] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6982148289680481] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.6982148289680481, \result=0.7663114070892334, x=-0.6982148289680481] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.64288330078125, fp(IN)=0.7663114070892334, IN=-0.6982148289680481] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6982148289680481, x=0.14071732759475708] [L28] __VERIFIER_error() VAL [IN=-0.6982148289680481, x=0.14071732759475708] ----- [2018-11-22 21:41:53,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:41:53 BoogieIcfgContainer [2018-11-22 21:41:53,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:41:53,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:41:53,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:41:53,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:41:53,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:38" (3/4) ... [2018-11-22 21:41:53,740 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #23#return; [?] CALL call #t~ret4 := main(); [?] ~IN~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [f_~x=(fp #b1 #b01111110 #b01100101011111000110101), |f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |f_#res|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01100101011111000110101), |f_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |f_#res|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), |main_#t~ret2|=(fp #b1 #b01111110 #b01001001001010000000000)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101)] [?] ~x := #in~x;#res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [fp_~x=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#res|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#in~x|=(fp #b1 #b01111110 #b01100101011111000110101), |fp_#res|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), |main_#t~ret2|=(fp #b1 #b01111110 #b01001001001010000000000), |main_#t~ret3|=(fp #b0 #b01111110 #b10001000010110011111100)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01100101011111000110101), main_~x~0=(fp #b0 #b01111100 #b00100000001100000110100)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~IN~0, ~fp.neg~FLOAT(~to_fp~FLOAT(~roundNearestTiesToEven, 0.8))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 0.8)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L4-L7] ~x := #in~x; [L6] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~x, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 6.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 120.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 5040.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L9-L12] ~x := #in~x; [L11] #res := ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 24.0))), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~FLOAT(~roundNearestTiesToEven, 720.0))); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 2397184bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 4467964bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 3325493bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 124bv8, 1054772bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.6982148289680481] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.6982148289680481, \result=-0.64288330078125, x=-0.6982148289680481] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.64288330078125, IN=-0.6982148289680481] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6982148289680481] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.6982148289680481, \result=0.7663114070892334, x=-0.6982148289680481] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.64288330078125, fp(IN)=0.7663114070892334, IN=-0.6982148289680481] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6982148289680481, x=0.14071732759475708] [L28] __VERIFIER_error() VAL [IN=-0.6982148289680481, x=0.14071732759475708] ----- [2018-11-22 21:41:53,774 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_647b8e33-8112-45eb-b943-e00e01e937b3/bin-2019/uautomizer/witness.graphml [2018-11-22 21:41:53,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:41:53,775 INFO L168 Benchmark]: Toolchain (without parser) took 21044.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:53,776 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:53,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:53,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:53,777 INFO L168 Benchmark]: Boogie Preprocessor took 14.86 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:53,777 INFO L168 Benchmark]: RCFGBuilder took 5261.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:53,778 INFO L168 Benchmark]: TraceAbstraction took 15540.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:53,778 INFO L168 Benchmark]: Witness Printer took 36.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:53,780 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.86 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 5261.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15540.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.6982148289680481] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.6982148289680481, \result=-0.64288330078125, x=-0.6982148289680481] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.64288330078125, IN=-0.6982148289680481] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6982148289680481] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.6982148289680481, \result=0.7663114070892334, x=-0.6982148289680481] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.64288330078125, fp(IN)=0.7663114070892334, IN=-0.6982148289680481] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6982148289680481, x=0.14071732759475708] [L28] __VERIFIER_error() VAL [IN=-0.6982148289680481, x=0.14071732759475708] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 15.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 9.8s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...