./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/newton_1_5_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_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/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 e4382b57b29a0b5934fceb56c089bfd5b9abbe48 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/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 e4382b57b29a0b5934fceb56c089bfd5b9abbe48 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 06:30:56,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:30:56,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:30:56,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:30:56,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:30:56,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:30:56,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:30:56,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:30:56,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:30:56,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:30:56,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:30:56,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:30:56,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:30:56,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:30:56,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:30:56,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:30:56,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:30:56,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:30:56,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:30:56,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:30:56,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:30:56,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:30:56,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:30:56,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:30:56,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:30:56,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:30:56,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:30:56,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:30:56,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:30:56,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:30:56,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:30:56,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:30:56,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:30:56,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:30:56,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:30:56,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:30:56,872 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 06:30:56,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:30:56,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:30:56,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:30:56,883 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:30:56,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:30:56,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:30:56,884 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:30:56,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:30:56,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:30:56,885 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:30:56,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:30:56,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:30:56,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:30:56,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:30:56,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:30:56,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:30:56,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:30:56,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:30:56,887 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_f6c087b2-5990-4568-931a-452829e9f0f6/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 -> e4382b57b29a0b5934fceb56c089bfd5b9abbe48 [2018-11-23 06:30:56,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:30:56,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:30:56,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:30:56,921 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:30:56,921 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:30:56,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:30:56,957 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/f733ab5b0/8c43dd3d6139415d9b21ddb771ebbd9a/FLAG432172ed8 [2018-11-23 06:30:57,374 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:30:57,374 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:30:57,379 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/f733ab5b0/8c43dd3d6139415d9b21ddb771ebbd9a/FLAG432172ed8 [2018-11-23 06:30:57,389 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/f733ab5b0/8c43dd3d6139415d9b21ddb771ebbd9a [2018-11-23 06:30:57,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:30:57,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:30:57,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:30:57,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:30:57,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:30:57,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4044db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57, skipping insertion in model container [2018-11-23 06:30:57,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:30:57,415 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:30:57,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:30:57,530 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:30:57,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:30:57,551 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:30:57,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57 WrapperNode [2018-11-23 06:30:57,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:30:57,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:30:57,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:30:57,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:30:57,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:30:57,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:30:57,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:30:57,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:30:57,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... [2018-11-23 06:30:57,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:30:57,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:30:57,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:30:57,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:30:57,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/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-23 06:30:57,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:30:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:30:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 06:30:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 06:30:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:30:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:30:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 06:30:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 06:30:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:30:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:30:57,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:30:57,720 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:30:57,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:30:57 BoogieIcfgContainer [2018-11-23 06:30:57,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:30:57,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:30:57,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:30:57,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:30:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:30:57" (1/3) ... [2018-11-23 06:30:57,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522151bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:30:57, skipping insertion in model container [2018-11-23 06:30:57,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:30:57" (2/3) ... [2018-11-23 06:30:57,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522151bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:30:57, skipping insertion in model container [2018-11-23 06:30:57,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:30:57" (3/3) ... [2018-11-23 06:30:57,727 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:30:57,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:30:57,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:30:57,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:30:57,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:30:57,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:30:57,765 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:30:57,765 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:30:57,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:30:57,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:30:57,765 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:30:57,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:30:57,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:30:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 06:30:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 06:30:57,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:30:57,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:30:57,785 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:30:57,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:30:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 06:30:57,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:30:57,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:30:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:30:57,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:30:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:30:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:30:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:30:57,860 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3;havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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(1.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) 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~ret3; [L19] havoc #t~ret2; 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-23 06:30:57,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:30:57 BoogieIcfgContainer [2018-11-23 06:30:57,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:30:57,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:30:57,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:30:57,886 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:30:57,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:30:57" (3/4) ... [2018-11-23 06:30:57,889 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:30:57,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:30:57,890 INFO L168 Benchmark]: Toolchain (without parser) took 498.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:30:57,891 INFO L168 Benchmark]: CDTParser took 0.10 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-23 06:30:57,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:30:57,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 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-23 06:30:57,893 INFO L168 Benchmark]: Boogie Preprocessor took 11.50 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-23 06:30:57,893 INFO L168 Benchmark]: RCFGBuilder took 144.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:30:57,894 INFO L168 Benchmark]: TraceAbstraction took 163.95 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.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:30:57,895 INFO L168 Benchmark]: Witness Printer took 3.92 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-23 06:30:57,897 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.10 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 159.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 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 11.50 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 144.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 163.95 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.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 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-23 06:30:59,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:30:59,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:30:59,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:30:59,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:30:59,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:30:59,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:30:59,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:30:59,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:30:59,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:30:59,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:30:59,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:30:59,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:30:59,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:30:59,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:30:59,359 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:30:59,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:30:59,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:30:59,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:30:59,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:30:59,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:30:59,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:30:59,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:30:59,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:30:59,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:30:59,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:30:59,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:30:59,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:30:59,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:30:59,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:30:59,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:30:59,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:30:59,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:30:59,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:30:59,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:30:59,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:30:59,374 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 06:30:59,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:30:59,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:30:59,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:30:59,385 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:30:59,385 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:30:59,385 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:30:59,386 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:30:59,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:30:59,387 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:30:59,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:30:59,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:30:59,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:30:59,389 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:30:59,390 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:30:59,390 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_f6c087b2-5990-4568-931a-452829e9f0f6/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 -> e4382b57b29a0b5934fceb56c089bfd5b9abbe48 [2018-11-23 06:30:59,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:30:59,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:30:59,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:30:59,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:30:59,434 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:30:59,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:30:59,482 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/94d032697/f8efad9268a1448b92658140577101ff/FLAGd051e84f3 [2018-11-23 06:30:59,801 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:30:59,801 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/sv-benchmarks/c/floats-cdfpl/newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:30:59,805 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/94d032697/f8efad9268a1448b92658140577101ff/FLAGd051e84f3 [2018-11-23 06:31:00,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/data/94d032697/f8efad9268a1448b92658140577101ff [2018-11-23 06:31:00,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:31:00,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:31:00,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:31:00,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:31:00,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:31:00,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679a0c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00, skipping insertion in model container [2018-11-23 06:31:00,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:31:00,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:31:00,394 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:31:00,398 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:31:00,411 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:31:00,422 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:31:00,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00 WrapperNode [2018-11-23 06:31:00,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:31:00,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:31:00,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:31:00,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:31:00,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:31:00,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:31:00,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:31:00,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:31:00,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... [2018-11-23 06:31:00,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:31:00,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:31:00,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:31:00,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:31:00,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/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-23 06:31:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:31:00,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:31:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 06:31:00,538 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 06:31:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:31:00,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:31:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 06:31:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 06:31:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:31:00,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:31:06,468 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:31:06,468 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:31:06,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:31:06 BoogieIcfgContainer [2018-11-23 06:31:06,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:31:06,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:31:06,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:31:06,471 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:31:06,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:31:00" (1/3) ... [2018-11-23 06:31:06,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed36081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:31:06, skipping insertion in model container [2018-11-23 06:31:06,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:31:00" (2/3) ... [2018-11-23 06:31:06,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed36081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:31:06, skipping insertion in model container [2018-11-23 06:31:06,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:31:06" (3/3) ... [2018-11-23 06:31:06,473 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_5_false-unreach-call_true-termination.i [2018-11-23 06:31:06,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:31:06,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:31:06,497 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:31:06,515 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:31:06,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:31:06,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:31:06,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:31:06,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:31:06,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:31:06,516 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:31:06,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:31:06,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:31:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 06:31:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 06:31:06,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:31:06,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:31:06,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:31:06,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:31:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 06:31:06,544 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:31:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/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-23 06:31:06,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:31:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:32:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:32:25,173 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110)] [?] ~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 #b11110110110101111110110), |f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |f_#res|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b11110110110101111110110), |f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |f_#res|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), |main_#t~ret2|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110)] [?] ~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 #b11110110110101111110110), |fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#res|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#res|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), |main_#t~ret2|=(fp #b1 #b01111110 #b10101001111111101011111), |main_#t~ret3|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret3;havoc #t~ret2; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.9821161031723022] [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.9821161031723022, \result=-0.8320216536521912, x=-0.9821161031723022] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.8320216536521912, IN=-0.9821161031723022] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.9821161031723022] [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.9821161031723022, \result=0.5577353239059448, x=-0.9821161031723022] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.8320216536521912, fp(IN)=0.5577353239059448, IN=-0.9821161031723022] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.9821161031723022, x=0.5096697807312012] [L28] __VERIFIER_error() VAL [IN=-0.9821161031723022, x=0.5096697807312012] ----- [2018-11-23 06:32:25,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:32:25 BoogieIcfgContainer [2018-11-23 06:32:25,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:32:25,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:32:25,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:32:25,210 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:32:25,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:31:06" (3/4) ... [2018-11-23 06:32:25,212 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110)] [?] ~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 #b11110110110101111110110), |f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |f_#res|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b11110110110101111110110), |f_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |f_#res|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), |main_#t~ret2|=(fp #b1 #b01111110 #b10101001111111101011111)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110)] [?] ~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 #b11110110110101111110110), |fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#res|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#in~x|=(fp #b1 #b01111110 #b11110110110101111110110), |fp_#res|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), |main_#t~ret2|=(fp #b1 #b01111110 #b10101001111111101011111), |main_#t~ret3|=(fp #b0 #b01111110 #b00011101100011110111110)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret3;havoc #t~ret2; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b11110110110101111110110), main_~x~0=(fp #b0 #b01111110 #b00000100111100110111000)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [?] 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] ----- ----- 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, 1.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 1.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [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, 8088566bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 5570399bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 968638bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret3; [L19] havoc #t~ret2; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 8088566bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 126bv8, 162232bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.9821161031723022] [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.9821161031723022, \result=-0.8320216536521912, x=-0.9821161031723022] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.8320216536521912, IN=-0.9821161031723022] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.9821161031723022] [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.9821161031723022, \result=0.5577353239059448, x=-0.9821161031723022] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.8320216536521912, fp(IN)=0.5577353239059448, IN=-0.9821161031723022] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.9821161031723022, x=0.5096697807312012] [L28] __VERIFIER_error() VAL [IN=-0.9821161031723022, x=0.5096697807312012] ----- [2018-11-23 06:32:25,252 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f6c087b2-5990-4568-931a-452829e9f0f6/bin-2019/uautomizer/witness.graphml [2018-11-23 06:32:25,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:32:25,253 INFO L168 Benchmark]: Toolchain (without parser) took 85012.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:25,254 INFO L168 Benchmark]: CDTParser took 0.16 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-23 06:32:25,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:25,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:25,255 INFO L168 Benchmark]: Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:25,255 INFO L168 Benchmark]: RCFGBuilder took 6008.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:25,256 INFO L168 Benchmark]: TraceAbstraction took 78739.83 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:25,256 INFO L168 Benchmark]: Witness Printer took 42.94 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-23 06:32:25,258 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.16 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 181.81 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 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 16.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6008.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78739.83 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.94 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.9821161031723022] [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.9821161031723022, \result=-0.8320216536521912, x=-0.9821161031723022] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.8320216536521912, IN=-0.9821161031723022] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.9821161031723022] [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.9821161031723022, \result=0.5577353239059448, x=-0.9821161031723022] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.8320216536521912, fp(IN)=0.5577353239059448, IN=-0.9821161031723022] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.9821161031723022, x=0.5096697807312012] [L28] __VERIFIER_error() VAL [IN=-0.9821161031723022, x=0.5096697807312012] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 78.6s 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, 3.1s 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...