./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cdfpl/newton_1_8_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_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e9eabaef1f2b99f50e18602924ca00b4cf8f91d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e9eabaef1f2b99f50e18602924ca00b4cf8f91d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:28:14,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:28:14,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:28:14,404 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:28:14,404 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:28:14,405 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:28:14,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:28:14,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:28:14,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:28:14,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:28:14,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:28:14,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:28:14,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:28:14,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:28:14,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:28:14,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:28:14,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:28:14,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:28:14,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:28:14,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:28:14,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:28:14,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:28:14,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:28:14,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:28:14,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:28:14,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:28:14,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:28:14,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:28:14,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:28:14,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:28:14,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:28:14,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:28:14,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:28:14,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:28:14,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:28:14,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:28:14,426 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 03:28:14,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:28:14,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:28:14,437 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:28:14,437 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:28:14,437 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:28:14,437 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:28:14,437 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 03:28:14,438 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:28:14,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:28:14,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:28:14,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:28:14,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:28:14,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:28:14,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:28:14,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:28:14,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:28:14,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:28:14,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:28:14,443 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:28:14,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:28:14,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:28:14,443 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:28:14,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:28:14,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:28:14,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:28:14,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:28:14,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:28:14,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:28:14,444 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 03:28:14,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:28:14,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:28:14,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 03:28:14,445 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan 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 -> Taipan 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 -> 2e9eabaef1f2b99f50e18602924ca00b4cf8f91d [2018-11-23 03:28:14,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:28:14,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:28:14,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:28:14,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:28:14,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:28:14,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:14,545 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/5205c201e/d818317b00f3433a93c73caff57ee278/FLAG838a0ffc2 [2018-11-23 03:28:14,901 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:28:14,901 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:14,907 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/5205c201e/d818317b00f3433a93c73caff57ee278/FLAG838a0ffc2 [2018-11-23 03:28:15,313 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/5205c201e/d818317b00f3433a93c73caff57ee278 [2018-11-23 03:28:15,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:28:15,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:28:15,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:15,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:28:15,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:28:15,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15, skipping insertion in model container [2018-11-23 03:28:15,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:28:15,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:28:15,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:15,505 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:28:15,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:15,529 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:28:15,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15 WrapperNode [2018-11-23 03:28:15,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:15,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:15,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:28:15,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:28:15,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:15,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:28:15,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:28:15,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:28:15,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... [2018-11-23 03:28:15,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:28:15,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:28:15,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:28:15,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:28:15,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/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 03:28:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:28:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:28:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 03:28:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 03:28:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:28:15,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:28:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 03:28:15,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 03:28:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:28:15,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:28:15,751 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:28:15,752 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:28:15,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:15 BoogieIcfgContainer [2018-11-23 03:28:15,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:28:15,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:28:15,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:28:15,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:28:15,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:28:15" (1/3) ... [2018-11-23 03:28:15,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8a368d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:15, skipping insertion in model container [2018-11-23 03:28:15,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:15" (2/3) ... [2018-11-23 03:28:15,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8a368d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:15, skipping insertion in model container [2018-11-23 03:28:15,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:15" (3/3) ... [2018-11-23 03:28:15,760 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:15,769 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:28:15,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:28:15,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:28:15,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:28:15,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:28:15,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:28:15,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:28:15,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:28:15,822 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:28:15,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:28:15,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:28:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 03:28:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 03:28:15,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:15,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:15,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:15,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 03:28:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:28:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:15,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:15,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:28:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:28:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:28:15,953 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(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2;havoc #t~ret3; VAL [main_~IN~0=2.0] [?] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [main_~IN~0=2.0] [?] assume !false; VAL [main_~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27-L28] assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1); VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L16] ~IN~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(2.0)) && ~someBinaryFLOATComparisonOperation(~IN~0, 2.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~ret2; [L19] havoc #t~ret3; VAL [~IN~0=2.0] [L27] COND TRUE !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1) VAL [~IN~0=2.0] [L28] assert false; VAL [~IN~0=2.0] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=2] [L6] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR f(IN) VAL [f(IN)=1, IN=2] [L19] CALL, EXPR fp(IN) VAL [\old(x)=2] [L11] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=2, x=2] [L19] RET, EXPR fp(IN) VAL [f(IN)=1, fp(IN)=0, IN=2] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=2] [L28] __VERIFIER_error() VAL [IN=2] ----- [2018-11-23 03:28:15,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:28:15 BoogieIcfgContainer [2018-11-23 03:28:15,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:28:15,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:28:15,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:28:15,982 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:28:15,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:15" (3/4) ... [2018-11-23 03:28:15,986 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:28:15,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:28:15,987 INFO L168 Benchmark]: Toolchain (without parser) took 669.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:15,988 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:15,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:15,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.14 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.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 03:28:15,990 INFO L168 Benchmark]: Boogie Preprocessor took 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:15,990 INFO L168 Benchmark]: RCFGBuilder took 191.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:15,991 INFO L168 Benchmark]: TraceAbstraction took 228.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:15,992 INFO L168 Benchmark]: Witness Printer took 3.89 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:15,996 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.14 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.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 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 191.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 228.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 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: 2.7 MB). Peak memory consumption was 2.7 MB. 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 03:28:17,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:28:17,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:28:17,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:28:17,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:28:17,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:28:17,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:28:17,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:28:17,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:28:17,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:28:17,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:28:17,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:28:17,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:28:17,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:28:17,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:28:17,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:28:17,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:28:17,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:28:17,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:28:17,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:28:17,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:28:17,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:28:17,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:28:17,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:28:17,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:28:17,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:28:17,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:28:17,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:28:17,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:28:17,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:28:17,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:28:17,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:28:17,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:28:17,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:28:17,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:28:17,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:28:17,753 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 03:28:17,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:28:17,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:28:17,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:28:17,767 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:28:17,767 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:28:17,767 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:28:17,768 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:28:17,768 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:28:17,768 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:28:17,768 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:28:17,769 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:28:17,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:28:17,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:28:17,769 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:28:17,769 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:28:17,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:28:17,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:28:17,770 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:28:17,770 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:28:17,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:28:17,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:28:17,771 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:28:17,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:28:17,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:28:17,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:28:17,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:28:17,772 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:28:17,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:28:17,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:28:17,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:28:17,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:28:17,773 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 03:28:17,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:28:17,773 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:28:17,773 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:28:17,773 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_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan 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 -> Taipan 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 -> 2e9eabaef1f2b99f50e18602924ca00b4cf8f91d [2018-11-23 03:28:17,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:28:17,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:28:17,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:28:17,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:28:17,822 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:28:17,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/../../sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:17,865 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/8da8e701f/f9bd9be516e44433a183727297f19182/FLAG648974c1d [2018-11-23 03:28:18,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:28:18,219 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/sv-benchmarks/c/floats-cdfpl/newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:18,224 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/8da8e701f/f9bd9be516e44433a183727297f19182/FLAG648974c1d [2018-11-23 03:28:18,235 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/data/8da8e701f/f9bd9be516e44433a183727297f19182 [2018-11-23 03:28:18,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:28:18,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:28:18,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:18,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:28:18,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:28:18,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e7d3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18, skipping insertion in model container [2018-11-23 03:28:18,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:28:18,270 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:28:18,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:18,417 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:28:18,434 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:18,447 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:28:18,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18 WrapperNode [2018-11-23 03:28:18,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:18,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:18,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:28:18,448 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:28:18,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:18,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:28:18,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:28:18,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:28:18,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... [2018-11-23 03:28:18,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:28:18,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:28:18,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:28:18,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:28:18,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/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 03:28:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:28:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:28:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 03:28:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 03:28:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:28:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:28:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2018-11-23 03:28:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2018-11-23 03:28:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:28:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:28:24,541 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:28:24,541 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:28:24,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:24 BoogieIcfgContainer [2018-11-23 03:28:24,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:28:24,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:28:24,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:28:24,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:28:24,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:28:18" (1/3) ... [2018-11-23 03:28:24,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527febd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:24, skipping insertion in model container [2018-11-23 03:28:24,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:18" (2/3) ... [2018-11-23 03:28:24,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527febd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:24, skipping insertion in model container [2018-11-23 03:28:24,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:24" (3/3) ... [2018-11-23 03:28:24,550 INFO L112 eAbstractionObserver]: Analyzing ICFG newton_1_8_false-unreach-call_true-termination.i [2018-11-23 03:28:24,558 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:28:24,564 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:28:24,581 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:28:24,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:28:24,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:28:24,606 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:28:24,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:28:24,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:28:24,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:28:24,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:28:24,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:28:24,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:28:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 03:28:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 03:28:24,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:24,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:24,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:24,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1667394832, now seen corresponding path program 1 times [2018-11-23 03:28:24,634 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:28:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/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 03:28:24,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:28:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:28:33,096 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111)] [?] ~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 #b01001010111111111000111), |f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |f_#res|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01001010111111111000111), |f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |f_#res|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), |main_#t~ret2|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111)] [?] ~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 #b01001010111111111000111), |fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#res|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#res|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), |main_#t~ret2|=(fp #b1 #b01111110 #b00110100011011011100001), |main_#t~ret3|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.6464809775352478] [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.6464809775352478, \result=-0.6023998856544495, x=-0.6464809775352478] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.6023998856544495, IN=-0.6464809775352478] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6464809775352478] [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.6464809775352478, \result=0.7984105944633484, x=-0.6464809775352478] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.6023998856544495, fp(IN)=0.7984105944633484, IN=-0.6464809775352478] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6464809775352478, x=0.10801786184310913] [L28] __VERIFIER_error() VAL [IN=-0.6464809775352478, x=0.10801786184310913] ----- [2018-11-23 03:28:33,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:28:33 BoogieIcfgContainer [2018-11-23 03:28:33,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:28:33,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:28:33,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:28:33,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:28:33,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:24" (3/4) ... [2018-11-23 03:28:33,139 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111)] [?] CALL call #t~ret2 := f(~IN~0); VAL [|f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111)] [?] ~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 #b01001010111111111000111), |f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |f_#res|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] assume true; VAL [f_~x=(fp #b1 #b01111110 #b01001010111111111000111), |f_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |f_#res|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] RET #27#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), |main_#t~ret2|=(fp #b1 #b01111110 #b00110100011011011100001)] [?] CALL call #t~ret3 := fp(~IN~0); VAL [|fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111)] [?] ~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 #b01001010111111111000111), |fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#res|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] assume true; VAL [fp_~x=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#in~x|=(fp #b1 #b01111110 #b01001010111111111000111), |fp_#res|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] RET #29#return; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), |main_#t~ret2|=(fp #b1 #b01111110 #b00110100011011011100001), |main_#t~ret3|=(fp #b0 #b01111110 #b10011000110010010100011)] [?] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] assume !false; VAL [main_~IN~0=(fp #b1 #b01111110 #b01001010111111111000111), main_~x~0=(fp #b0 #b01111011 #b10111010011100001111000)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L4-L7] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L9-L12] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27-L28] assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [?] 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] ----- ----- 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, 2.0))) && ~fp.lt~FLOAT(~IN~0, ~to_fp~FLOAT(~roundNearestTiesToEven, 2.0)) then 1bv32 else 0bv32); VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret2 := f(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret2 := f(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] CALL call #t~ret3 := fp(~IN~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [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, 2457543bv23), #res=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~x=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] RET call #t~ret3 := fp(~IN~0); VAL [#t~ret2=~fp~LONGDOUBLE(1bv1, 126bv8, 1717985bv23), #t~ret3=~fp~LONGDOUBLE(0bv1, 126bv8, 5006499bv23), ~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23)] [L19] ~x~0 := ~fp.sub~FLOAT(~roundNearestTiesToEven, ~IN~0, ~fp.div~FLOAT(~roundNearestTiesToEven, #t~ret2, #t~ret3)); [L19] havoc #t~ret2; [L19] havoc #t~ret3; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L27] COND TRUE !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(~roundNearestTiesToEven, ~x~0), ~to_fp~DOUBLE(~roundNearestTiesToEven, 0.1)) VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L28] assert false; VAL [~IN~0=~fp~LONGDOUBLE(1bv1, 126bv8, 2457543bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 123bv8, 6109304bv23)] [L16] float IN = __VERIFIER_nondet_float(); [L19] CALL, EXPR f(IN) VAL [\old(x)=-0.6464809775352478] [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.6464809775352478, \result=-0.6023998856544495, x=-0.6464809775352478] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.6023998856544495, IN=-0.6464809775352478] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6464809775352478] [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.6464809775352478, \result=0.7984105944633484, x=-0.6464809775352478] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.6023998856544495, fp(IN)=0.7984105944633484, IN=-0.6464809775352478] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6464809775352478, x=0.10801786184310913] [L28] __VERIFIER_error() VAL [IN=-0.6464809775352478, x=0.10801786184310913] ----- [2018-11-23 03:28:33,178 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d00ff01c-5271-4444-8756-fb53d8d945b7/bin-2019/utaipan/witness.graphml [2018-11-23 03:28:33,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:28:33,179 INFO L168 Benchmark]: Toolchain (without parser) took 14940.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:33,180 INFO L168 Benchmark]: CDTParser took 0.14 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 03:28:33,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.33 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:33,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:33,181 INFO L168 Benchmark]: Boogie Preprocessor took 26.51 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:33,181 INFO L168 Benchmark]: RCFGBuilder took 6049.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:33,181 INFO L168 Benchmark]: TraceAbstraction took 8593.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:33,182 INFO L168 Benchmark]: Witness Printer took 42.14 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 03:28:33,183 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.33 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.51 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6049.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8593.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Witness Printer took 42.14 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.6464809775352478] [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.6464809775352478, \result=-0.6023998856544495, x=-0.6464809775352478] [L19] RET, EXPR f(IN) VAL [f(IN)=-0.6023998856544495, IN=-0.6464809775352478] [L19] CALL, EXPR fp(IN) VAL [\old(x)=-0.6464809775352478] [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.6464809775352478, \result=0.7984105944633484, x=-0.6464809775352478] [L19] RET, EXPR fp(IN) VAL [f(IN)=-0.6023998856544495, fp(IN)=0.7984105944633484, IN=-0.6464809775352478] [L19] float x = IN - f(IN)/fp(IN); [L27] COND TRUE !(x < 0.1) VAL [IN=-0.6464809775352478, x=0.10801786184310913] [L28] __VERIFIER_error() VAL [IN=-0.6464809775352478, x=0.10801786184310913] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 8.5s 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, 2.9s 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...