./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c --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_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 6f57b560c2271100a3cc213cf38aa06905e4b86e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 6f57b560c2271100a3cc213cf38aa06905e4b86e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:55:09,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:55:09,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:55:09,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:55:09,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:55:09,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:55:09,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:55:09,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:55:09,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:55:09,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:55:09,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:55:09,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:55:09,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:55:09,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:55:09,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:55:09,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:55:09,421 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:55:09,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:55:09,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:55:09,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:55:09,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:55:09,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:55:09,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:55:09,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:55:09,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:55:09,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:55:09,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:55:09,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:55:09,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:55:09,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:55:09,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:55:09,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:55:09,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:55:09,435 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:55:09,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:55:09,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:55:09,437 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:55:09,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:55:09,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:55:09,448 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:55:09,448 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:55:09,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:55:09,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:55:09,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:55:09,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:55:09,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:55:09,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:55:09,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:55:09,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:55:09,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:55:09,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:55:09,452 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_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 -> 6f57b560c2271100a3cc213cf38aa06905e4b86e [2018-11-23 00:55:09,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:55:09,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:55:09,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:55:09,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:55:09,492 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:55:09,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:09,548 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/c17bd3cf7/214ee1cfd2974251bae36d5d42258d75/FLAG908da1a5c [2018-11-23 00:55:09,906 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:55:09,906 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:09,911 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/c17bd3cf7/214ee1cfd2974251bae36d5d42258d75/FLAG908da1a5c [2018-11-23 00:55:10,326 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/c17bd3cf7/214ee1cfd2974251bae36d5d42258d75 [2018-11-23 00:55:10,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:55:10,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:55:10,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:55:10,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:55:10,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:55:10,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f51b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10, skipping insertion in model container [2018-11-23 00:55:10,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:55:10,370 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:55:10,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:55:10,518 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:55:10,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:55:10,558 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:55:10,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10 WrapperNode [2018-11-23 00:55:10,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:55:10,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:55:10,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:55:10,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:55:10,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:55:10,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:55:10,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:55:10,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:55:10,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... [2018-11-23 00:55:10,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:55:10,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:55:10,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:55:10,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:55:10,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 00:55:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 00:55:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 00:55:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:55:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:55:10,691 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 00:55:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 00:55:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:55:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:55:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 00:55:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 00:55:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 00:55:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:55:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:55:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:55:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:55:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:55:10,927 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:55:10,927 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 00:55:10,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:10 BoogieIcfgContainer [2018-11-23 00:55:10,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:55:10,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:55:10,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:55:10,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:55:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:10" (1/3) ... [2018-11-23 00:55:10,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ddbb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:10, skipping insertion in model container [2018-11-23 00:55:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:10" (2/3) ... [2018-11-23 00:55:10,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ddbb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:10, skipping insertion in model container [2018-11-23 00:55:10,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:10" (3/3) ... [2018-11-23 00:55:10,933 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:10,942 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:55:10,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:55:10,967 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:55:10,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:55:10,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:55:10,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:55:10,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:55:10,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:55:10,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:55:10,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:55:10,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:55:10,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:55:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 00:55:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:55:11,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:11,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:11,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:11,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1757694217, now seen corresponding path program 1 times [2018-11-23 00:55:11,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:55:11,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:55:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:11,140 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 00:55:11,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:11,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:55:11,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:55:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:55:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:55:11,157 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-23 00:55:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:11,175 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2018-11-23 00:55:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:55:11,176 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 00:55:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:11,183 INFO L225 Difference]: With dead ends: 79 [2018-11-23 00:55:11,183 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 00:55:11,186 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 00:55:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 00:55:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 00:55:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 00:55:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 00:55:11,217 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2018-11-23 00:55:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:11,217 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 00:55:11,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:55:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 00:55:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:55:11,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:11,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:11,220 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:11,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1795675250, now seen corresponding path program 1 times [2018-11-23 00:55:11,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:55:11,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:55:11,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:11,294 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 00:55:11,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:11,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:11,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:11,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:11,298 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 00:55:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:11,346 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 00:55:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:11,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 00:55:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:11,349 INFO L225 Difference]: With dead ends: 59 [2018-11-23 00:55:11,349 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 00:55:11,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 00:55:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 00:55:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:55:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 00:55:11,359 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2018-11-23 00:55:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:11,359 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 00:55:11,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 00:55:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:55:11,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:11,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:11,360 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:11,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2106279408, now seen corresponding path program 1 times [2018-11-23 00:55:11,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:55:11,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:55:11,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:11,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:11,407 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 00:55:11,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:11,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:11,409 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-23 00:55:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:11,443 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 00:55:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:11,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 00:55:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:11,445 INFO L225 Difference]: With dead ends: 63 [2018-11-23 00:55:11,445 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:55:11,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:55:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 00:55:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:55:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 00:55:11,452 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2018-11-23 00:55:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:11,452 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 00:55:11,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 00:55:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:55:11,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:11,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:11,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:11,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash 309328049, now seen corresponding path program 1 times [2018-11-23 00:55:11,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:55:11,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:55:11,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:11,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:55:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:55:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:55:11,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4293918727, |#NULL.offset|=4293918722, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918727, |old(#NULL.offset)|=4293918722] [?] RET #94#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=0.0, fmax_double_~y=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] goto; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0, |__fpclassify_double_#res|=0] [?] RET #90#return; VAL [fmax_double_~x=0.0, fmax_double_~y=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0, |fmax_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmax_double_~x=0.0, fmax_double_~y=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0, |fmax_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmax_double_~x=0.0, fmax_double_~y=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0, |fmax_double_#res|=4293918726.0] [?] assume true; VAL [fmax_double_~x=0.0, fmax_double_~y=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=0.0, |fmax_double_#in~y|=4293918726.0, |fmax_double_#res|=4293918726.0] [?] RET #98#return; VAL [main_~x~0=0.0, main_~y~0=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=4293918726.0] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=4293918726.0, main_~x~0=0.0, main_~y~0=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11; VAL [main_~res~0=4293918726.0, main_~x~0=0.0, main_~y~0=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~ret10;havoc #t~short11; VAL [main_~res~0=4293918726.0, main_~x~0=0.0, main_~y~0=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4293918726.0, main_~x~0=0.0, main_~y~0=4293918726.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918727, #NULL.offset=4293918722, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L23-L48] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52-L53] assume 0 == #t~ret4; [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L50-L58] ensures true; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84-L87] assume !#t~short11; [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918727, #NULL.offset=4293918722, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918727, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L23-L48] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52-L53] assume 0 == #t~ret4; [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L50-L58] ensures true; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL.base=0, #NULL.offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84-L87] assume !#t~short11; [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918727, #NULL!offset=4293918722, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918727, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L79] ~x~0 := 0.0; [L80] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918726E9] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918726E9] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918726E9, #NULL!base=0, #NULL!offset=0, #res=4.293918726E9, ~x=0.0, ~y=4.293918726E9] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918726E9, ~x~0=0.0, ~y~0=4.293918726E9] [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0, \old(y)=4293918726] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=0, \result=0, lsw=1, msw=4293918721, x=0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=4293918726, __fpclassify_double(x)=0, x=0, y=4293918726] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=0, \old(y)=4293918726, \result=4293918726, x=0, y=4293918726] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4293918726, x=0, y=4293918726] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=4293918726, res == 0.0 && __signbit_double(res) == 0=0, x=0, y=4293918726] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=4293918726, x=0, y=4293918726] ----- [2018-11-23 00:55:11,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:11 BoogieIcfgContainer [2018-11-23 00:55:11,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:55:11,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:55:11,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:55:11,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:55:11,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:10" (3/4) ... [2018-11-23 00:55:11,560 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:55:11,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:55:11,561 INFO L168 Benchmark]: Toolchain (without parser) took 1230.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:11,562 INFO L168 Benchmark]: CDTParser took 0.17 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 00:55:11,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:11,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:55:11,564 INFO L168 Benchmark]: Boogie Preprocessor took 69.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:11,564 INFO L168 Benchmark]: RCFGBuilder took 276.88 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:11,565 INFO L168 Benchmark]: TraceAbstraction took 626.74 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:11,566 INFO L168 Benchmark]: Witness Printer took 4.70 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 00:55:11,569 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.17 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 227.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.88 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 626.74 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 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: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 80. Possible FailurePath: [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0, \old(y)=4293918726] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; VAL [\old(x)=0, \result=0, lsw=1, msw=4293918721, x=0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=4293918726, __fpclassify_double(x)=0, x=0, y=4293918726] [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; VAL [\old(x)=0, \old(y)=4293918726, \result=4293918726, x=0, y=4293918726] [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4293918726, x=0, y=4293918726] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=4293918726, res == 0.0 && __signbit_double(res) == 0=0, x=0, y=4293918726] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=4293918726, x=0, y=4293918726] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 0 SDslu, 172 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 00:55:13,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:55:13,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:55:13,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:55:13,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:55:13,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:55:13,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:55:13,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:55:13,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:55:13,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:55:13,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:55:13,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:55:13,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:55:13,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:55:13,263 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:55:13,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:55:13,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:55:13,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:55:13,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:55:13,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:55:13,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:55:13,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:55:13,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:55:13,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:55:13,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:55:13,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:55:13,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:55:13,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:55:13,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:55:13,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:55:13,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:55:13,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:55:13,280 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:55:13,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:55:13,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:55:13,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:55:13,282 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 00:55:13,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:55:13,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:55:13,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:55:13,296 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:55:13,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:55:13,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:55:13,297 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:55:13,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:55:13,297 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:55:13,298 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:55:13,299 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:55:13,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:55:13,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:55:13,299 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:55:13,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:55:13,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:55:13,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:55:13,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:55:13,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:55:13,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:55:13,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:55:13,301 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:55:13,302 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_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 -> 6f57b560c2271100a3cc213cf38aa06905e4b86e [2018-11-23 00:55:13,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:55:13,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:55:13,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:55:13,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:55:13,349 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:55:13,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:13,393 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/3e16b5a7a/7860a26771be4a61ae04266a5ad31f7c/FLAG96ba5253f [2018-11-23 00:55:13,738 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:55:13,739 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/sv-benchmarks/c/float-newlib/double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:13,743 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/3e16b5a7a/7860a26771be4a61ae04266a5ad31f7c/FLAG96ba5253f [2018-11-23 00:55:14,157 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/data/3e16b5a7a/7860a26771be4a61ae04266a5ad31f7c [2018-11-23 00:55:14,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:55:14,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:55:14,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:55:14,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:55:14,165 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:55:14,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12511f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14, skipping insertion in model container [2018-11-23 00:55:14,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:55:14,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:55:14,337 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:55:14,342 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:55:14,367 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:55:14,388 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:55:14,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14 WrapperNode [2018-11-23 00:55:14,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:55:14,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:55:14,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:55:14,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:55:14,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:55:14,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:55:14,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:55:14,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:55:14,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... [2018-11-23 00:55:14,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:55:14,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:55:14,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:55:14,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:55:14,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 00:55:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 00:55:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 00:55:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 00:55:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:55:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:55:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 00:55:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 00:55:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:55:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:55:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 00:55:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 00:55:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:55:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:55:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:55:14,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:55:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:55:14,685 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:55:14,764 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:55:14,789 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:55:14,789 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 00:55:14,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:14 BoogieIcfgContainer [2018-11-23 00:55:14,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:55:14,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:55:14,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:55:14,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:55:14,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:14" (1/3) ... [2018-11-23 00:55:14,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e1295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:14, skipping insertion in model container [2018-11-23 00:55:14,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:14" (2/3) ... [2018-11-23 00:55:14,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e1295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:14, skipping insertion in model container [2018-11-23 00:55:14,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:14" (3/3) ... [2018-11-23 00:55:14,797 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b_false-unreach-call.c [2018-11-23 00:55:14,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:55:14,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:55:14,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:55:14,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:55:14,846 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:55:14,846 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:55:14,847 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:55:14,847 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:55:14,847 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:55:14,847 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:55:14,847 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:55:14,847 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:55:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 00:55:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:55:14,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:14,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:14,866 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1896135752, now seen corresponding path program 1 times [2018-11-23 00:55:14,874 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 00:55:14,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:14,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:14,959 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 00:55:14,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:14,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:14,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:55:14,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:55:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:55:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:55:14,986 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 00:55:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:15,004 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 00:55:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:55:15,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 00:55:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:15,013 INFO L225 Difference]: With dead ends: 75 [2018-11-23 00:55:15,013 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 00:55:15,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 00:55:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 00:55:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 00:55:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 00:55:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 00:55:15,049 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-23 00:55:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:15,050 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 00:55:15,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:55:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 00:55:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:55:15,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:15,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:15,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:15,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -944725945, now seen corresponding path program 1 times [2018-11-23 00:55:15,053 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 00:55:15,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:15,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:15,153 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 00:55:15,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:15,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:15,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:15,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:15,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,172 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 00:55:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:15,240 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 00:55:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:15,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 00:55:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:15,244 INFO L225 Difference]: With dead ends: 56 [2018-11-23 00:55:15,244 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 00:55:15,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 00:55:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 00:55:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:55:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 00:55:15,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 00:55:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:15,254 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 00:55:15,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 00:55:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:55:15,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:15,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:15,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:15,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -190309307, now seen corresponding path program 1 times [2018-11-23 00:55:15,256 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/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 00:55:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:15,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:15,336 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 00:55:15,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:15,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:15,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:15,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,347 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 00:55:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:15,386 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 00:55:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:15,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 00:55:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:15,388 INFO L225 Difference]: With dead ends: 59 [2018-11-23 00:55:15,388 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 00:55:15,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 00:55:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 00:55:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:55:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 00:55:15,393 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 23 [2018-11-23 00:55:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:15,394 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 00:55:15,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 00:55:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:55:15,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:15,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:15,395 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:15,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash 935715971, now seen corresponding path program 1 times [2018-11-23 00:55:15,395 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:15,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:15,476 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 00:55:15,476 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:15,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:15,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:15,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:15,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,491 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 00:55:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:15,549 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 00:55:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:15,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 00:55:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:15,551 INFO L225 Difference]: With dead ends: 59 [2018-11-23 00:55:15,551 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 00:55:15,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 00:55:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 00:55:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:55:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 00:55:15,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2018-11-23 00:55:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:15,556 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 00:55:15,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 00:55:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:55:15,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:15,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:15,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:15,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 696707201, now seen corresponding path program 1 times [2018-11-23 00:55:15,558 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:15,558 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:15,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:15,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:15,623 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 00:55:15,624 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:15,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:15,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:15,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,633 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 00:55:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:15,671 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 00:55:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:15,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 00:55:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:15,673 INFO L225 Difference]: With dead ends: 59 [2018-11-23 00:55:15,673 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 00:55:15,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 00:55:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 00:55:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 00:55:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 00:55:15,680 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 25 [2018-11-23 00:55:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:15,680 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 00:55:15,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 00:55:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:55:15,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:15,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:15,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:15,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash 500193696, now seen corresponding path program 1 times [2018-11-23 00:55:15,683 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:15,683 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:15,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:15,836 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 00:55:15,837 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:55:15,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:55:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:55:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:55:15,855 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2018-11-23 00:55:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:16,118 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 00:55:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:55:16,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 00:55:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:16,120 INFO L225 Difference]: With dead ends: 48 [2018-11-23 00:55:16,120 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:55:16,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:55:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:55:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:55:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:55:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 00:55:16,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2018-11-23 00:55:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:16,129 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 00:55:16,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:55:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 00:55:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:55:16,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:16,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:16,132 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:16,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1230715632, now seen corresponding path program 1 times [2018-11-23 00:55:16,133 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:16,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:16,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:55:16,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:16,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:16,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:16,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,244 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-11-23 00:55:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:16,283 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 00:55:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:16,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 00:55:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:16,285 INFO L225 Difference]: With dead ends: 63 [2018-11-23 00:55:16,285 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:55:16,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:55:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 00:55:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:55:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 00:55:16,292 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 30 [2018-11-23 00:55:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:16,292 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 00:55:16,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 00:55:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:55:16,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:16,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:16,294 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:16,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1937025982, now seen corresponding path program 1 times [2018-11-23 00:55:16,295 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:16,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:16,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:55:16,388 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:16,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:16,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,402 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 00:55:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:16,430 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 00:55:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:16,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 00:55:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:16,431 INFO L225 Difference]: With dead ends: 66 [2018-11-23 00:55:16,431 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 00:55:16,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 00:55:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 00:55:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:55:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 00:55:16,437 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2018-11-23 00:55:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:16,438 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 00:55:16,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 00:55:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:55:16,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:16,439 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:16,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:16,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:16,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1151102924, now seen corresponding path program 1 times [2018-11-23 00:55:16,440 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:16,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:16,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:55:16,558 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:16,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,568 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 00:55:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:16,593 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 00:55:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:16,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 00:55:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:16,594 INFO L225 Difference]: With dead ends: 66 [2018-11-23 00:55:16,595 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 00:55:16,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 00:55:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 00:55:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:55:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 00:55:16,601 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2018-11-23 00:55:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 00:55:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 00:55:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:55:16,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:16,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:16,603 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:16,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1413761077, now seen corresponding path program 1 times [2018-11-23 00:55:16,603 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:16,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:16,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 00:55:16,769 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:16,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:16,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:55:16,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:55:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:55:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:55:16,779 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 5 states. [2018-11-23 00:55:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:16,953 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 00:55:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:55:16,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 00:55:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:16,955 INFO L225 Difference]: With dead ends: 64 [2018-11-23 00:55:16,955 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:55:16,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:55:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:55:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 00:55:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:55:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 00:55:16,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 00:55:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:16,962 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 00:55:16,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:55:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 00:55:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:55:16,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:16,963 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:16,964 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:16,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 604414451, now seen corresponding path program 1 times [2018-11-23 00:55:16,964 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:16,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:17,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 00:55:17,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:55:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:55:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:55:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:55:17,123 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 00:55:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:17,382 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 00:55:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:55:17,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 00:55:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:17,383 INFO L225 Difference]: With dead ends: 55 [2018-11-23 00:55:17,383 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 00:55:17,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:55:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 00:55:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 00:55:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:55:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 00:55:17,387 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 00:55:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:17,387 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 00:55:17,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:55:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 00:55:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:55:17,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:17,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:17,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:17,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 717344413, now seen corresponding path program 1 times [2018-11-23 00:55:17,389 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:17,389 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:17,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:17,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:17,507 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:55:17,508 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:55:17,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 00:55:17,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:55:17,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 00:55:17,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:55:17,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 00:55:17,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 00:55:17,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:55:17,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:55:17,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:55:17,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:55:17,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 00:55:17,654 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 00:55:17,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:17,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:17,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:55:17,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:55:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:55:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:55:17,668 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 00:55:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:18,331 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 00:55:18,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:55:18,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 00:55:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:18,332 INFO L225 Difference]: With dead ends: 75 [2018-11-23 00:55:18,333 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 00:55:18,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:55:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 00:55:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 00:55:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:55:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 00:55:18,338 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 00:55:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:18,338 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 00:55:18,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:55:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 00:55:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:55:18,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:18,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:18,339 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:18,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1607764478, now seen corresponding path program 1 times [2018-11-23 00:55:18,340 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:18,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:55:18,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:18,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:55:18,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:55:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:55:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:18,418 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-23 00:55:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:18,439 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-23 00:55:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:55:18,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 00:55:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:18,440 INFO L225 Difference]: With dead ends: 65 [2018-11-23 00:55:18,440 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 00:55:18,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:55:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 00:55:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 00:55:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:55:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 00:55:18,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2018-11-23 00:55:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:18,444 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 00:55:18,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:55:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 00:55:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:55:18,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:18,445 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:18,445 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:18,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:18,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1411250973, now seen corresponding path program 1 times [2018-11-23 00:55:18,445 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:18,446 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:18,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 00:55:18,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:55:18,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:55:18,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:55:18,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:55:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:55:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:55:18,558 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2018-11-23 00:55:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:55:18,799 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-23 00:55:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:55:18,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 00:55:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:55:18,800 INFO L225 Difference]: With dead ends: 50 [2018-11-23 00:55:18,800 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 00:55:18,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:55:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 00:55:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 00:55:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:55:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 00:55:18,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2018-11-23 00:55:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:55:18,803 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 00:55:18,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:55:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 00:55:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 00:55:18,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:55:18,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:55:18,804 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:55:18,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:55:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -329247760, now seen corresponding path program 1 times [2018-11-23 00:55:18,805 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:55:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 00:55:18,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:55:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:55:19,151 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv3 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] RET #92#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~x~0 := ~Pluszero~DOUBLE();~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #88#return; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ret4|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret4);havoc #t~ret4; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret5 := __fpclassify_double(~y); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #90#return; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ret5|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret5);havoc #t~ret5; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume !~fp.gt~DOUBLE(~x, ~y);#t~ite6 := ~y; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ite6|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := #t~ite6;havoc #t~ite6; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#res|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume true; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#res|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] RET #96#return; VAL [main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret9|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] CALL call #t~ret10 := __signbit_double(~res~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~1; VAL [__signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32);~msw~1 := #t~mem7;call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);havoc #t~union8;havoc #t~mem7;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv1 32)] [?] assume true; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv1 32)] [?] RET #98#return; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv1 32), |main_#t~short11|=true] [?] #t~short11 := 0bv32 == #t~ret10; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv1 32), |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=3bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52-L53] assume !(0bv32 == #t~ret4); [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54-L55] assume !(0bv32 == #t~ret5); [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] assume !~fp.gt~DOUBLE(~x, ~y); [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L50-L58] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L65] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L66] ~msw~1 := #t~mem7; [L66] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L64] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L60-L70] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84-L87] assume !#t~short11; [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=3bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52-L53] assume !(0bv32 == #t~ret4); [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54-L55] assume !(0bv32 == #t~ret5); [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] assume !~fp.gt~DOUBLE(~x, ~y); [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L50-L58] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L65] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L66] ~msw~1 := #t~mem7; [L66] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L64] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L60-L70] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84-L87] assume !#t~short11; [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0.0, y=0.0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L52] COND FALSE !(__fpclassify_double(x) == 0) [L54] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L54] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(y) == 0) [L57] EXPR x > y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x > y ? x : y=0.0, y=0.0] [L57] return x > y ? x : y; [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0.0, x=0.0, y=0.0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L61] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L64] ieee_double_shape_type gh_u; [L65] gh_u.value = (x) [L66] EXPR gh_u.parts.msw [L66] (msw) = gh_u.parts.msw [L69] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=1, msw=2147483648, x=0.0] [L84] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=0, x=0.0, y=0.0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] ----- [2018-11-23 00:55:19,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:19 BoogieIcfgContainer [2018-11-23 00:55:19,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:55:19,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:55:19,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:55:19,220 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:55:19,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:14" (3/4) ... [2018-11-23 00:55:19,227 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv3 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv3 32)] [?] RET #92#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~x~0 := ~Pluszero~DOUBLE();~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv0 32), __fpclassify_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #88#return; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ret4|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret4);havoc #t~ret4; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] CALL call #t~ret5 := __fpclassify_double(~y); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem0;call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem2;call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] assume true; VAL [__fpclassify_double_~lsw~0=(_ bv0 32), __fpclassify_double_~msw~0=(_ bv2147483648 32), __fpclassify_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__fpclassify_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__fpclassify_double_#res|=(_ bv2 32)] [?] RET #90#return; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ret5|=(_ bv2 32)] [?] assume !(0bv32 == #t~ret5);havoc #t~ret5; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume !~fp.gt~DOUBLE(~x, ~y);#t~ite6 := ~y; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#t~ite6|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := #t~ite6;havoc #t~ite6; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#res|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] assume true; VAL [fmax_double_~x=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), fmax_double_~y=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |fmax_double_#in~x|=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#in~y|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |fmax_double_#res|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] RET #96#return; VAL [main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret9|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short11|=true] [?] CALL call #t~ret10 := __signbit_double(~res~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] ~x := #in~x;havoc ~msw~1; VAL [__signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32);~msw~1 := #t~mem7;call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32);havoc #t~union8;havoc #t~mem7;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] goto; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000)] [?] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv1 32)] [?] assume true; VAL [__signbit_double_~msw~1=(_ bv2147483648 32), __signbit_double_~x=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__signbit_double_#in~x|=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |__signbit_double_#res|=(_ bv1 32)] [?] RET #98#return; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv1 32), |main_#t~short11|=true] [?] #t~short11 := 0bv32 == #t~ret10; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret10|=(_ bv1 32), |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~res~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~x~0=(fp #b0 #b00000000000 #b0000000000000000000000000000000000000000000000000000), main_~y~0=(fp #b1 #b00000000000 #b0000000000000000000000000000000000000000000000000000), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=3bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52-L53] assume !(0bv32 == #t~ret4); [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54-L55] assume !(0bv32 == #t~ret5); [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] assume !~fp.gt~DOUBLE(~x, ~y); [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L50-L58] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L65] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L66] ~msw~1 := #t~mem7; [L66] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L64] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L60-L70] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84-L87] assume !#t~short11; [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=3bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52-L53] assume !(0bv32 == #t~ret4); [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8bv32); [L28] call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] call #t~mem0 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32); [L29] ~msw~0 := #t~mem0; [L29] call write~intFLOATTYPE8(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] call #t~mem2 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] call write~intFLOATTYPE8(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L47] assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0); [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L23-L48] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54-L55] assume !(0bv32 == #t~ret5); [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] assume !~fp.gt~DOUBLE(~x, ~y); [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L50-L58] ensures true; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] assume #t~short11; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8bv32); [L65] call write~intFLOATTYPE8(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] call #t~mem7 := read~intINTTYPE4(~#gh_u~0.base, ~bvadd32(4bv32, ~#gh_u~0.offset), 4bv32); [L66] ~msw~1 := #t~mem7; [L66] call write~intFLOATTYPE8(#t~union8, ~#gh_u~0.base, ~#gh_u~0.offset, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L64] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L60-L70] ensures true; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL.base=0bv32, #NULL.offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84-L87] assume !#t~short11; [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=3bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L79] ~x~0 := ~Pluszero~DOUBLE(); [L80] ~y~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52)] [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret4=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L52] COND FALSE !(0bv32 == #t~ret4) [L52] havoc #t~ret4; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] CALL call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8bv32); [L28] FCALL call write~intFLOATTYPE8(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~bvadd32(4bv32, ~#ew_u~0!offset) }, 4bv32); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~intFLOATTYPE8(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L29] havoc #t~union1; [L29] havoc #t~mem0; [L30] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4bv32); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~intFLOATTYPE8(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8bv32); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L33-L34] COND TRUE (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0) [L35] #res := 2bv32; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=2bv32, ~lsw~0=0bv32, ~msw~0=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] RET call #t~ret5 := __fpclassify_double(~y); VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=2bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L54] COND FALSE !(0bv32 == #t~ret5) [L54] havoc #t~ret5; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] COND FALSE !(~fp.gt~DOUBLE(~x, ~y)) [L57] #t~ite6 := ~y; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #t~ite6=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L57] #res := #t~ite6; [L57] havoc #t~ite6; VAL [#in~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), #in~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret9=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~fp.eq~DOUBLE(~res~0, ~Pluszero~DOUBLE()); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE #t~short11 VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] CALL call #t~ret10 := __signbit_double(~res~0); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32] [L60-L70] ~x := #in~x; [L61] havoc ~msw~1; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L64] FCALL call ~#gh_u~0 := #Ultimate.alloc(8bv32); [L65] FCALL call write~intFLOATTYPE8(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#gh_u~0!base, offset: ~bvadd32(4bv32, ~#gh_u~0!offset) }, 4bv32); [L66] ~msw~1 := #t~mem7; [L66] FCALL call write~intFLOATTYPE8(#t~union8, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8bv32); [L66] havoc #t~union8; [L66] havoc #t~mem7; [L64] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L64] havoc ~#gh_u~0; VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L69] #res := (if 0bv32 != ~bvand32(2147483648bv32, ~msw~1) then 1bv32 else 0bv32); VAL [#in~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), #NULL!base=0bv32, #NULL!offset=0bv32, #res=1bv32, ~msw~1=2147483648bv32, ~x=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] RET call #t~ret10 := __signbit_double(~res~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=true, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] #t~short11 := 0bv32 == #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret10=1bv32, #t~short11=false, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L84] COND TRUE !#t~short11 [L84] havoc #t~short11; [L84] havoc #t~ret10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L85] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~res~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52), ~x~0=~fp~LONGDOUBLE(0bv1, 0bv11, 0bv52), ~y~0=~fp~LONGDOUBLE(1bv1, 0bv11, 0bv52)] [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0.0, y=0.0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L52] COND FALSE !(__fpclassify_double(x) == 0) [L54] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L54] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(y) == 0) [L57] EXPR x > y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x > y ? x : y=0.0, y=0.0] [L57] return x > y ? x : y; [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0.0, x=0.0, y=0.0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L61] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L64] ieee_double_shape_type gh_u; [L65] gh_u.value = (x) [L66] EXPR gh_u.parts.msw [L66] (msw) = gh_u.parts.msw [L69] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=1, msw=2147483648, x=0.0] [L84] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=0, x=0.0, y=0.0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] ----- [2018-11-23 00:55:19,444 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c5474e92-7b3f-42f8-b1bd-303eaf6ed2fb/bin-2019/uautomizer/witness.graphml [2018-11-23 00:55:19,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:55:19,445 INFO L168 Benchmark]: Toolchain (without parser) took 5283.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:19,446 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:55:19,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.77 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:19,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.25 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:55:19,447 INFO L168 Benchmark]: Boogie Preprocessor took 29.23 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:55:19,447 INFO L168 Benchmark]: RCFGBuilder took 348.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:19,447 INFO L168 Benchmark]: TraceAbstraction took 4428.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:19,447 INFO L168 Benchmark]: Witness Printer took 224.23 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:55:19,449 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.77 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.25 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.23 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 348.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4428.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Witness Printer took 224.23 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 85]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L79] double x = 0.0; [L80] double y = -0.0; VAL [x=0.0, y=0.0] [L81] CALL, EXPR fmax_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L52] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L52] COND FALSE !(__fpclassify_double(x) == 0) [L54] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L24] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L35] return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L54] RET, EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(y) == 0) [L57] EXPR x > y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x > y ? x : y=0.0, y=0.0] [L57] return x > y ? x : y; [L81] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=0.0, x=0.0, y=0.0] [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L61] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L64] ieee_double_shape_type gh_u; [L65] gh_u.value = (x) [L66] EXPR gh_u.parts.msw [L66] (msw) = gh_u.parts.msw [L69] return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=1, msw=2147483648, x=0.0] [L84] RET, EXPR __signbit_double(res) VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=1, x=0.0, y=0.0] [L84] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [__signbit_double(res)=1, res=0.0, res == 0.0 && __signbit_double(res) == 0=0, x=0.0, y=0.0] [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. UNSAFE Result, 4.3s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 629 SDtfs, 91 SDslu, 1532 SDs, 0 SdLazy, 324 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=7, 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, 14 MinimizatonAttempts, 28 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 382 ConstructedInterpolants, 10 QuantifiedInterpolants, 20835 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...