./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.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_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac1c2f023046690eb69a7c8f4224e12d57f24d83 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac1c2f023046690eb69a7c8f4224e12d57f24d83 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:52:06,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:52:06,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:52:06,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:52:06,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:52:06,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:52:06,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:52:06,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:52:06,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:52:06,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:52:06,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:52:06,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:52:06,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:52:06,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:52:06,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:52:06,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:52:06,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:52:06,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:52:06,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:52:06,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:52:06,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:52:06,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:52:06,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:52:06,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:52:06,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:52:06,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:52:06,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:52:06,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:52:06,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:52:06,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:52:06,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:52:06,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:52:06,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:52:06,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:52:06,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:52:06,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:52:06,695 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:52:06,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:52:06,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:52:06,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:52:06,703 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:52:06,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:52:06,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:52:06,703 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:52:06,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:52:06,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:52:06,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:52:06,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:52:06,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:52:06,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:52:06,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:52:06,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:52:06,706 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:52:06,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:52:06,706 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_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac1c2f023046690eb69a7c8f4224e12d57f24d83 [2018-11-23 05:52:06,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:52:06,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:52:06,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:52:06,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:52:06,734 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:52:06,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i [2018-11-23 05:52:06,774 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/895ead5f4/229d4db86eab44a08ca145896ab6323a/FLAGbb9aee457 [2018-11-23 05:52:07,185 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:52:07,185 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i [2018-11-23 05:52:07,189 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/895ead5f4/229d4db86eab44a08ca145896ab6323a/FLAGbb9aee457 [2018-11-23 05:52:07,200 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/895ead5f4/229d4db86eab44a08ca145896ab6323a [2018-11-23 05:52:07,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:52:07,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:52:07,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:52:07,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:52:07,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:52:07,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07, skipping insertion in model container [2018-11-23 05:52:07,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:52:07,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:52:07,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:52:07,349 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:52:07,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:52:07,368 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:52:07,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07 WrapperNode [2018-11-23 05:52:07,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:52:07,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:52:07,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:52:07,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:52:07,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:52:07,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:52:07,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:52:07,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:52:07,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... [2018-11-23 05:52:07,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:52:07,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:52:07,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:52:07,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:52:07,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:52:07,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:52:07,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:52:07,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:52:07,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:52:07,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:52:07,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:52:07,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:52:07,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:52:07,565 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:52:07,565 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:52:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:07 BoogieIcfgContainer [2018-11-23 05:52:07,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:52:07,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:52:07,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:52:07,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:52:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:52:07" (1/3) ... [2018-11-23 05:52:07,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775abc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:52:07, skipping insertion in model container [2018-11-23 05:52:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:07" (2/3) ... [2018-11-23 05:52:07,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775abc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:52:07, skipping insertion in model container [2018-11-23 05:52:07,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:07" (3/3) ... [2018-11-23 05:52:07,571 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2_false-unreach-call.c.i [2018-11-23 05:52:07,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:52:07,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:52:07,591 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:52:07,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:52:07,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:52:07,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:52:07,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:52:07,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:52:07,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:52:07,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:52:07,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:52:07,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:52:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 05:52:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:52:07,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:07,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:07,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-11-23 05:52:07,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:52:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:52:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:52:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:52:07,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:52:07,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:52:07,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:52:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:52:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:52:07,718 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 05:52:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:52:07,731 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 05:52:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:52:07,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 05:52:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:52:07,738 INFO L225 Difference]: With dead ends: 34 [2018-11-23 05:52:07,738 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 05:52:07,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:52:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 05:52:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 05:52:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:52:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 05:52:07,765 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 05:52:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:07,765 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 05:52:07,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:52:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 05:52:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:52:07,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:07,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:07,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:07,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-11-23 05:52:07,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:52:07,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:52:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:52:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:52:07,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:52:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:52:07,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:52:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:52:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:07,852 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 05:52:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:52:07,889 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 05:52:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:52:07,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 05:52:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:52:07,890 INFO L225 Difference]: With dead ends: 27 [2018-11-23 05:52:07,890 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 05:52:07,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 05:52:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 05:52:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:52:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 05:52:07,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 05:52:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:07,894 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 05:52:07,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:52:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 05:52:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:52:07,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:07,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:07,895 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:07,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-11-23 05:52:07,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:52:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:52:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:52:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:52:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:52:07,929 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~pi~0)|=2.0, ~pi~0=2.0] [?] ~pi~0 := 3.14159; VAL [|old(~pi~0)|=2.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume true; VAL [|old(~pi~0)|=2.0, ~pi~0=(/ 314159.0 100000.0)] [?] RET #45#return; VAL [~pi~0=(/ 314159.0 100000.0)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=(/ 314159.0 100000.0)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3));assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0);~oddExp~0 := ~x~0;~evenExp~0 := 1.0;~term~0 := ~x~0;~count~0 := 2;~multFactor~0 := 0;havoc ~temp~0; VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~term~0=3.0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !false;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !(0 == ~count~0 / 2 % 4294967296);#t~ite2 := -1; VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~x~0=3.0, |main_#t~ite2|=(- 1), ~pi~0=(/ 314159.0 100000.0)] [?] ~multFactor~0 := #t~ite2;havoc #t~ite2;~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0));#t~post3 := ~count~0;~count~0 := 1 + #t~post3;havoc #t~post3;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0)));~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0));#t~post4 := ~count~0;~count~0 := 1 + #t~post4;havoc #t~post4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~temp~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~count~0=4, main_~multFactor~0=(- 1), main_~temp~0=0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume 0 == ~temp~0; VAL [main_~count~0=4, main_~multFactor~0=(- 1), main_~temp~0=0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] ensures true; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] assume !false; [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] assume !(0 == ~count~0 / 2 % 4294967296); [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] assume 0 == ~temp~0; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] ensures true; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] assume !false; [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] assume !(0 == ~count~0 / 2 % 4294967296); [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] assume 0 == ~temp~0; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L9] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(3)); [L17] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~convertINTToFLOAT(0)) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant~0) then 1 else 0); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := 1.0; [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2; [L22] ~multFactor~0 := 0; [L23] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L28] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := 1 + #t~post3; [L32] havoc #t~post3; [L34] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L36] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := 1 + #t~post4; [L38] havoc #t~post4; [L40] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L44] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~oddExp~0, ~evenExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L7] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L9] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L15] float x = __VERIFIER_nondet_float() ; [L16] float octant = pi/3 ; [L18] float oddExp = x ; [L19] float evenExp = 1.0 ; [L20] float term = x ; [L21] unsigned int count = 2 ; [L22] int multFactor = 0 ; [L23] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L25] COND TRUE 1 [L27] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L28] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L28] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L30] evenExp = evenExp + multFactor*term [L32] count++ [L34] term = term * (x/count) [L36] oddExp = oddExp + multFactor*term [L38] count++ [L40] temp = __VERIFIER_nondet_int() [L41] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L44] CALL __VERIFIER_assert( oddExp >= evenExp ) VAL [\old(cond)=0, pi=314159/100000] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] ----- [2018-11-23 05:52:07,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:52:07 BoogieIcfgContainer [2018-11-23 05:52:07,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:52:07,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:52:07,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:52:07,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:52:07,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:07" (3/4) ... [2018-11-23 05:52:07,962 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:52:07,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:52:07,963 INFO L168 Benchmark]: Toolchain (without parser) took 760.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,964 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:52:07,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.29 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.25 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,965 INFO L168 Benchmark]: Boogie Preprocessor took 48.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,966 INFO L168 Benchmark]: RCFGBuilder took 135.56 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,966 INFO L168 Benchmark]: TraceAbstraction took 393.31 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:07,967 INFO L168 Benchmark]: Witness Printer took 2.98 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 05:52:07,969 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.29 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.25 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 135.56 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 393.31 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: 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 someBinaryArithmeticFLOAToperation at line 30. Possible FailurePath: [L9] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L15] float x = __VERIFIER_nondet_float() ; [L16] float octant = pi/3 ; [L18] float oddExp = x ; [L19] float evenExp = 1.0 ; [L20] float term = x ; [L21] unsigned int count = 2 ; [L22] int multFactor = 0 ; [L23] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L25] COND TRUE 1 [L27] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L28] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L28] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L30] evenExp = evenExp + multFactor*term [L32] count++ [L34] term = term * (x/count) [L36] oddExp = oddExp + multFactor*term [L38] count++ [L40] temp = __VERIFIER_nondet_int() [L41] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L44] CALL __VERIFIER_assert( oddExp >= evenExp ) VAL [\old(cond)=0, pi=314159/100000] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 1 SDslu, 12 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 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: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 05:52:09,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:52:09,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:52:09,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:52:09,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:52:09,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:52:09,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:52:09,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:52:09,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:52:09,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:52:09,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:52:09,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:52:09,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:52:09,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:52:09,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:52:09,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:52:09,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:52:09,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:52:09,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:52:09,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:52:09,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:52:09,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:52:09,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:52:09,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:52:09,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:52:09,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:52:09,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:52:09,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:52:09,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:52:09,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:52:09,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:52:09,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:52:09,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:52:09,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:52:09,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:52:09,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:52:09,429 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 05:52:09,439 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:52:09,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:52:09,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:52:09,440 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:52:09,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:52:09,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:52:09,441 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:52:09,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:52:09,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:52:09,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:52:09,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:52:09,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:52:09,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:52:09,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:52:09,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:52:09,444 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:52:09,445 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_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac1c2f023046690eb69a7c8f4224e12d57f24d83 [2018-11-23 05:52:09,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:52:09,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:52:09,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:52:09,489 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:52:09,489 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:52:09,490 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i [2018-11-23 05:52:09,532 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/baa665cdc/c307a763c82845e9b2531aa1de5c5920/FLAGca1be573e [2018-11-23 05:52:09,849 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:52:09,850 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/sv-benchmarks/c/loop-floats-scientific-comp/loop2_false-unreach-call.c.i [2018-11-23 05:52:09,853 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/baa665cdc/c307a763c82845e9b2531aa1de5c5920/FLAGca1be573e [2018-11-23 05:52:10,289 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/data/baa665cdc/c307a763c82845e9b2531aa1de5c5920 [2018-11-23 05:52:10,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:52:10,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:52:10,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:52:10,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:52:10,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:52:10,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c58243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10, skipping insertion in model container [2018-11-23 05:52:10,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:52:10,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:52:10,433 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:52:10,437 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:52:10,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:52:10,460 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:52:10,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10 WrapperNode [2018-11-23 05:52:10,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:52:10,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:52:10,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:52:10,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:52:10,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:52:10,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:52:10,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:52:10,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:52:10,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... [2018-11-23 05:52:10,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:52:10,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:52:10,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:52:10,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:52:10,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:52:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:52:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:52:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:52:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:52:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:52:10,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:52:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:52:10,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:52:13,824 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:52:13,825 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:52:13,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:13 BoogieIcfgContainer [2018-11-23 05:52:13,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:52:13,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:52:13,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:52:13,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:52:13,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:52:10" (1/3) ... [2018-11-23 05:52:13,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e3f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:52:13, skipping insertion in model container [2018-11-23 05:52:13,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:52:10" (2/3) ... [2018-11-23 05:52:13,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7e3f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:52:13, skipping insertion in model container [2018-11-23 05:52:13,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:13" (3/3) ... [2018-11-23 05:52:13,831 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2_false-unreach-call.c.i [2018-11-23 05:52:13,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:52:13,842 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:52:13,853 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:52:13,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:52:13,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:52:13,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:52:13,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:52:13,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:52:13,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:52:13,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:52:13,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:52:13,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:52:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 05:52:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:52:13,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:13,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:13,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:13,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-11-23 05:52:13,895 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:52:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 05:52:13,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:52:13,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:52:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:52:13,974 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:52:13,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:52:13,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:52:13,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:52:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:52:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:52:13,998 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 05:52:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:52:14,014 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 05:52:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:52:14,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 05:52:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:52:14,020 INFO L225 Difference]: With dead ends: 34 [2018-11-23 05:52:14,020 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 05:52:14,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:52:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 05:52:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 05:52:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:52:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 05:52:14,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 05:52:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:14,047 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 05:52:14,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:52:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 05:52:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:52:14,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:14,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:14,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:14,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-11-23 05:52:14,049 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:52:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 05:52:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:52:14,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:52:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:52:14,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:52:14,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:52:14,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:52:14,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:52:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:52:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:14,760 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 05:52:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:52:18,485 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 05:52:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:52:18,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 05:52:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:52:18,486 INFO L225 Difference]: With dead ends: 27 [2018-11-23 05:52:18,487 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 05:52:18,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:52:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 05:52:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 05:52:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:52:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 05:52:18,490 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 05:52:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:52:18,490 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 05:52:18,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:52:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 05:52:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 05:52:18,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:52:18,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:52:18,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:52:18,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:52:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-11-23 05:52:18,491 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:52:18,491 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 05:52:18,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:52:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:52:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:52:19,871 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b00000000 #b00000000000000000000001)] [?] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume true; VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] RET #45#return; VAL [~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32));assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32);~oddExp~0 := ~x~0;~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~x~0;~count~0 := 2bv32;~multFactor~0 := 0bv32;havoc ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b00000000 #b10000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32));#t~ite2 := 4294967295bv32; VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b00000000 #b10000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), |main_#t~ite2|=(_ bv4294967295 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~multFactor~0 := #t~ite2;havoc #t~ite2;~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0));#t~post3 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0));#t~post4 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;~temp~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~count~0=(_ bv4 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv4294967295 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b00000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv4 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv4294967295 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b00000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] ensures true; VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] assume !false; [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32)); [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] assume 0bv32 == ~temp~0; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] ensures true; VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] assume !false; [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32)); [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] assume 0bv32 == ~temp~0; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L9] float pi = 3.14159 ; VAL [\old(pi)=0.000000000000000000000000000000000000000000001401298464324817, pi=3.141590118408203] [L15] float x = __VERIFIER_nondet_float() ; [L16] float octant = pi/3 ; [L18] float oddExp = x ; [L19] float evenExp = 1.0 ; [L20] float term = x ; [L21] unsigned int count = 2 ; [L22] int multFactor = 0 ; [L23] int temp ; VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.00000000000000000010842021724855044, x=0.00000000000000000010842021724855044] [L25] COND TRUE 1 [L27] term = term * (x/count) VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L30] evenExp = evenExp + multFactor*term [L32] count++ [L34] term = term * (x/count) [L36] oddExp = oddExp + multFactor*term [L38] count++ [L40] temp = __VERIFIER_nondet_int() [L41] COND TRUE temp == 0 VAL [count=4, evenExp=1.0, multFactor=4294967295, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, temp=0, term=0.0, x=0.00000000000000000010842021724855044] [L44] CALL __VERIFIER_assert( oddExp >= evenExp ) VAL [\old(cond)=0, pi=3.141590118408203] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=3.141590118408203] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=3.141590118408203] ----- [2018-11-23 05:52:19,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:52:19 BoogieIcfgContainer [2018-11-23 05:52:19,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:52:19,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:52:19,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:52:19,906 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:52:19,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:52:13" (3/4) ... [2018-11-23 05:52:19,907 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b00000000 #b00000000000000000000001)] [?] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume true; VAL [|old(~pi~0)|=(fp #b0 #b00000000 #b00000000000000000000001), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] RET #45#return; VAL [~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32));assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32);~oddExp~0 := ~x~0;~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~x~0;~count~0 := 2bv32;~multFactor~0 := 0bv32;havoc ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b00000000 #b10000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32));#t~ite2 := 4294967295bv32; VAL [main_~count~0=(_ bv2 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv0 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~term~0=(fp #b0 #b00000000 #b10000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), |main_#t~ite2|=(_ bv4294967295 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~multFactor~0 := #t~ite2;havoc #t~ite2;~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0));#t~post3 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0));#t~post4 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;~temp~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~count~0=(_ bv4 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv4294967295 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b00000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv4 32), main_~evenExp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~multFactor~0=(_ bv4294967295 32), main_~octant~0=(fp #b0 #b01111111 #b00001100000101010001011), main_~oddExp~0=(fp #b0 #b01000000 #b00000000000000000000000), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b00000000 #b00000000000000000000000), main_~x~0=(fp #b0 #b01000000 #b00000000000000000000000), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~pi~0=(fp #b0 #b10000000 #b10010010000111111010000)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] ensures true; VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] assume !false; [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32)); [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] assume 0bv32 == ~temp~0; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] ensures true; VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] assume !false; [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] assume !(0bv32 == ~bvlshr32(~count~0, 1bv32)); [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] assume 0bv32 == ~temp~0; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23)] [L9] ~pi~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 3.14159)); VAL [old(~pi~0)=~fp~LONGDOUBLE(0bv1, 0bv8, 1bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] RET call ULTIMATE.init(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~octant~0 := ~fp.div~FLOAT(~roundNearestTiesToEven, ~pi~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 3bv32)); [L17] assume 0bv32 != (if ~fp.gt~FLOAT(~x~0, ~convertINTToFLOAT(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~FLOAT(~x~0, ~octant~0) then 1bv32 else 0bv32); [L18] ~oddExp~0 := ~x~0; [L19] ~evenExp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L20] ~term~0 := ~x~0; [L21] ~count~0 := 2bv32; [L22] ~multFactor~0 := 0bv32; [L23] havoc ~temp~0; VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L25-L42] COND FALSE !(false) [L27] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); VAL [~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] COND FALSE !(0bv32 == ~bvlshr32(~count~0, 1bv32)) [L28] #t~ite2 := 4294967295bv32; VAL [#t~ite2=4294967295bv32, ~count~0=2bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=0bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 4194304bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L28] ~multFactor~0 := #t~ite2; [L28] havoc #t~ite2; [L30] ~evenExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~evenExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L32] #t~post3 := ~count~0; [L32] ~count~0 := ~bvadd32(1bv32, #t~post3); [L32] havoc #t~post3; [L34] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L36] ~oddExp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~oddExp~0, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, ~multFactor~0), ~term~0)); [L38] #t~post4 := ~count~0; [L38] ~count~0 := ~bvadd32(1bv32, #t~post4); [L38] havoc #t~post4; [L40] ~temp~0 := #t~nondet5; [L40] havoc #t~nondet5; VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L41] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=4bv32, ~evenExp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~multFactor~0=4294967295bv32, ~octant~0=~fp~LONGDOUBLE(0bv1, 127bv8, 395915bv23), ~oddExp~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23), ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 64bv8, 0bv23)] [L44] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~oddExp~0, ~evenExp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L7] assert false; VAL [#in~cond=0bv32, ~cond=0bv32, ~pi~0=~fp~LONGDOUBLE(0bv1, 128bv8, 4788176bv23)] [L9] float pi = 3.14159 ; VAL [\old(pi)=0.000000000000000000000000000000000000000000001401298464324817, pi=3.141590118408203] [L15] float x = __VERIFIER_nondet_float() ; [L16] float octant = pi/3 ; [L18] float oddExp = x ; [L19] float evenExp = 1.0 ; [L20] float term = x ; [L21] unsigned int count = 2 ; [L22] int multFactor = 0 ; [L23] int temp ; VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.00000000000000000010842021724855044, x=0.00000000000000000010842021724855044] [L25] COND TRUE 1 [L27] term = term * (x/count) VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L30] evenExp = evenExp + multFactor*term [L32] count++ [L34] term = term * (x/count) [L36] oddExp = oddExp + multFactor*term [L38] count++ [L40] temp = __VERIFIER_nondet_int() [L41] COND TRUE temp == 0 VAL [count=4, evenExp=1.0, multFactor=4294967295, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, temp=0, term=0.0, x=0.00000000000000000010842021724855044] [L44] CALL __VERIFIER_assert( oddExp >= evenExp ) VAL [\old(cond)=0, pi=3.141590118408203] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=3.141590118408203] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=3.141590118408203] ----- [2018-11-23 05:52:19,948 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_07ef6b9e-60dc-47d2-a713-45fc02d70b78/bin-2019/uautomizer/witness.graphml [2018-11-23 05:52:19,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:52:19,949 INFO L168 Benchmark]: Toolchain (without parser) took 9657.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -110.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:19,951 INFO L168 Benchmark]: CDTParser took 0.18 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 05:52:19,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:19,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.04 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:52:19,952 INFO L168 Benchmark]: Boogie Preprocessor took 16.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:52:19,952 INFO L168 Benchmark]: RCFGBuilder took 3332.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:19,952 INFO L168 Benchmark]: TraceAbstraction took 6079.25 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:52:19,953 INFO L168 Benchmark]: Witness Printer took 43.48 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 05:52:19,958 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.18 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 167.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.04 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3332.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6079.25 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.48 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: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] float pi = 3.14159 ; VAL [\old(pi)=0.000000000000000000000000000000000000000000001401298464324817, pi=3.141590118408203] [L15] float x = __VERIFIER_nondet_float() ; [L16] float octant = pi/3 ; [L18] float oddExp = x ; [L19] float evenExp = 1.0 ; [L20] float term = x ; [L21] unsigned int count = 2 ; [L22] int multFactor = 0 ; [L23] int temp ; VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.00000000000000000010842021724855044, x=0.00000000000000000010842021724855044] [L25] COND TRUE 1 [L27] term = term * (x/count) VAL [count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1.0, multFactor=0, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, term=0.0000000000000000000000000000000000000058774717541114375, x=0.00000000000000000010842021724855044] [L28] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L30] evenExp = evenExp + multFactor*term [L32] count++ [L34] term = term * (x/count) [L36] oddExp = oddExp + multFactor*term [L38] count++ [L40] temp = __VERIFIER_nondet_int() [L41] COND TRUE temp == 0 VAL [count=4, evenExp=1.0, multFactor=4294967295, octant=1.0471967458724976, oddExp=0.00000000000000000010842021724855044, pi=3.141590118408203, temp=0, term=0.0, x=0.00000000000000000010842021724855044] [L44] CALL __VERIFIER_assert( oddExp >= evenExp ) VAL [\old(cond)=0, pi=3.141590118408203] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=3.141590118408203] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=3.141590118408203] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 1 SDslu, 11 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 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: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 373 SizeOfPredicates, 1 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...