./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-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_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98b359d4210eaa0693e17be51fa07ce179f3b890 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98b359d4210eaa0693e17be51fa07ce179f3b890 ....................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:59:27,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:59:27,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:59:27,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:59:27,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:59:27,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:59:27,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:59:27,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:59:27,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:59:27,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:59:27,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:59:27,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:59:27,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:59:27,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:59:27,049 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:59:27,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:59:27,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:59:27,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:59:27,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:59:27,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:59:27,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:59:27,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:59:27,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:59:27,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:59:27,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:59:27,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:59:27,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:59:27,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:59:27,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:59:27,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:59:27,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:59:27,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:59:27,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:59:27,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:59:27,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:59:27,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:59:27,063 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 11:59:27,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:59:27,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:59:27,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:59:27,073 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 11:59:27,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:59:27,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:59:27,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:59:27,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:59:27,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:59:27,075 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:59:27,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:59:27,076 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 11:59:27,076 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 11:59:27,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:59:27,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:59:27,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 11:59:27,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:59:27,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:59:27,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:59:27,077 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 11:59:27,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:59:27,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:59:27,077 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_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak 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 -> Kojak 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2018-11-23 11:59:27,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:59:27,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:59:27,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:59:27,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:59:27,113 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:59:27,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 11:59:27,156 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/febb5aed7/3078b0515ba143179f2c1d36b7ff414e/FLAGb403ca33b [2018-11-23 11:59:27,554 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:59:27,554 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 11:59:27,558 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/febb5aed7/3078b0515ba143179f2c1d36b7ff414e/FLAGb403ca33b [2018-11-23 11:59:27,566 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/febb5aed7/3078b0515ba143179f2c1d36b7ff414e [2018-11-23 11:59:27,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:59:27,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:59:27,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:27,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:59:27,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:59:27,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4baec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27, skipping insertion in model container [2018-11-23 11:59:27,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:59:27,596 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:59:27,725 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:27,732 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:59:27,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:27,801 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:59:27,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27 WrapperNode [2018-11-23 11:59:27,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:27,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:27,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:59:27,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:59:27,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:27,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:59:27,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:59:27,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:59:27,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... [2018-11-23 11:59:27,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:59:27,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:59:27,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:59:27,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:59:27,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 11:59:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 11:59:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:59:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 11:59:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:59:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:59:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:59:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-23 11:59:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:59:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:28,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:28,305 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 11:59:28,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:28 BoogieIcfgContainer [2018-11-23 11:59:28,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:28,306 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 11:59:28,307 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 11:59:28,313 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 11:59:28,314 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:28" (1/1) ... [2018-11-23 11:59:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 48 states and 79 transitions. [2018-11-23 11:59:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2018-11-23 11:59:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:59:28,355 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,445 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 11:59:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 48 states and 72 transitions. [2018-11-23 11:59:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2018-11-23 11:59:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:28,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,484 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 11:59:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 48 states and 68 transitions. [2018-11-23 11:59:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2018-11-23 11:59:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:28,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,509 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 11:59:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 48 states and 66 transitions. [2018-11-23 11:59:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2018-11-23 11:59:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:28,513 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,532 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 11:59:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 48 states and 64 transitions. [2018-11-23 11:59:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2018-11-23 11:59:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:28,535 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,591 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 11:59:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 49 states and 65 transitions. [2018-11-23 11:59:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2018-11-23 11:59:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:59:28,611 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:59:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:59:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:59:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:59:28,766 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 6 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_modf~0 := 1.0;havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.alloc(8);call write~init~real(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);call modf_double_#t~mem0 := read~int(modf_double_~#ew_u~0.base, 4 + modf_double_~#ew_u~0.offset, 4);modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);havoc modf_double_#t~union1;havoc modf_double_#t~mem0;call modf_double_#t~mem2 := read~int(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4);modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);havoc modf_double_#t~union3;havoc modf_double_#t~mem2;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] assume modf_double_~j0~0 < 20; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] assume modf_double_~j0~0 < 0; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.alloc(8);call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), modf_double_~#iw_u~0.base, 4 + modf_double_~#iw_u~0.offset, 4);call write~int(0, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4);call modf_double_#t~mem4 := read~real(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8);call write~real(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8);havoc modf_double_#t~mem4;call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset);havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, ~one_modf~0=1.0] [?] modf_double_#res := modf_double_~x; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 8);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; VAL [ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);call isinf_double_#t~mem21 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~mem23;havoc isinf_double_#t~union24;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; VAL [ULTIMATE.start_isinf_double_~hx~0=9402, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] goto; VAL [ULTIMATE.start_isinf_double_~hx~0=9402, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296);main_#t~ret30 := isinf_double_#res;assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647;main_#t~short33 := 0 != main_#t~ret30; VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_#t~ret30|=(- 1), |ULTIMATE.start_main_#t~short33|=true, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] assume main_#t~short33;main_#t~short32 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_#t~ret30|=(- 1), |ULTIMATE.start_main_#t~short32|=false, |ULTIMATE.start_main_#t~short33|=true, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] assume !main_#t~short32; VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_#t~ret30|=(- 1), |ULTIMATE.start_main_#t~short32|=false, |ULTIMATE.start_main_#t~short33|=true, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] main_#t~short33 := !main_#t~short32; VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_#t~mem29|=3.0, |ULTIMATE.start_main_#t~ret30|=(- 1), |ULTIMATE.start_main_#t~short32|=false, |ULTIMATE.start_main_#t~short33|=true, |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] assume main_#t~short33;havoc main_#t~mem29;havoc main_#t~ret30;havoc main_#t~short33;havoc main_#t~ret31;havoc main_#t~short32; VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] assume !false; VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=7629, ULTIMATE.start_isinf_double_~x=3.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_modf_double_~i0~0=7065, ULTIMATE.start_modf_double_~i1~0=0, ULTIMATE.start_modf_double_~iptr.base=3, ULTIMATE.start_modf_double_~iptr.offset=0, ULTIMATE.start_modf_double_~j0~0=(- 1), ULTIMATE.start_modf_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=3.0, |ULTIMATE.start_isinf_double_#res|=(- 1), |ULTIMATE.start_main_~#iptr~0.base|=3, |ULTIMATE.start_main_~#iptr~0.offset|=0, |ULTIMATE.start_modf_double_#in~iptr.base|=3, |ULTIMATE.start_modf_double_#in~iptr.offset|=0, |ULTIMATE.start_modf_double_#in~x|=0.0, |ULTIMATE.start_modf_double_#res|=0.0, ~one_modf~0=1.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; [?] havoc main_#res; [?] havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0; [L144] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8); [L145] havoc main_#t~nondet27; [L146] modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset; [L146] havoc modf_double_#res; [L146] havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0; [L20-L108] modf_double_~x := modf_double_#in~x; [L20-L108] modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset; [L21] havoc modf_double_~i0~0; [L21] havoc modf_double_~i1~0; [L21] havoc modf_double_~j0~0; [L22] havoc modf_double_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L24] call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L26] call modf_double_#t~mem0 := read~int(modf_double_~#ew_u~0.base, 4 + modf_double_~#ew_u~0.offset, 4); [L26] modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L26] havoc modf_double_#t~union1; [L26] havoc modf_double_#t~mem0; [L27] call modf_double_#t~mem2 := read~int(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4); [L27] modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L27] havoc modf_double_#t~union3; [L27] havoc modf_double_#t~mem2; [L24] call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset); [L24] havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L29] modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L30-L107] assume modf_double_~j0~0 < 20; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L31-L65] assume modf_double_~j0~0 < 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L33] call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), modf_double_~#iw_u~0.base, 4 + modf_double_~#iw_u~0.offset, 4); [L35] call write~int(0, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4); [L36] call modf_double_#t~mem4 := read~real(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8); [L36] call write~real(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8); [L36] havoc modf_double_#t~mem4; [L33] call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset); [L33] havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L38] modf_double_#res := modf_double_~x; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L146] main_#t~ret28 := modf_double_#res; [L146] main_~res~0 := main_#t~ret28; [L146] havoc main_#t~ret28; [L149] call main_#t~mem29 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 8); [L149] isinf_double_#in~x := main_#t~mem29; [L149] havoc isinf_double_#res; [L149] havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L111-L123] isinf_double_~x := isinf_double_#in~x; [L112] havoc isinf_double_~hx~0; [L112] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L114] call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L116] call isinf_double_#t~mem21 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4); [L116] isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L116] havoc isinf_double_#t~union22; [L116] havoc isinf_double_#t~mem21; [L117] call isinf_double_#t~mem23 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4); [L117] isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L117] havoc isinf_double_#t~mem23; [L117] havoc isinf_double_#t~union24; [L114] call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset); [L114] havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_~hx~0=9402, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L119] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L120] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L122] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] main_#t~ret30 := isinf_double_#res; [L149] assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647; [L149] main_#t~short33 := 0 != main_#t~ret30; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] assume main_#t~short33; [L149] main_#t~short32 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] assume !main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] main_#t~short33 := !main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149-L152] assume main_#t~short33; [L149] havoc main_#t~mem29; [L149] havoc main_#t~ret30; [L149] havoc main_#t~short33; [L149] havoc main_#t~ret31; [L149] havoc main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; [?] havoc main_#res; [?] havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0; [L144] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8); [L145] havoc main_#t~nondet27; [L146] modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset; [L146] havoc modf_double_#res; [L146] havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0; [L20-L108] modf_double_~x := modf_double_#in~x; [L20-L108] modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset; [L21] havoc modf_double_~i0~0; [L21] havoc modf_double_~i1~0; [L21] havoc modf_double_~j0~0; [L22] havoc modf_double_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L24] call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L26] call modf_double_#t~mem0 := read~int(modf_double_~#ew_u~0.base, 4 + modf_double_~#ew_u~0.offset, 4); [L26] modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L26] havoc modf_double_#t~union1; [L26] havoc modf_double_#t~mem0; [L27] call modf_double_#t~mem2 := read~int(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4); [L27] modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8); [L27] havoc modf_double_#t~union3; [L27] havoc modf_double_#t~mem2; [L24] call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset); [L24] havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L29] modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L30-L107] assume modf_double_~j0~0 < 20; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L31-L65] assume modf_double_~j0~0 < 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L33] call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), modf_double_~#iw_u~0.base, 4 + modf_double_~#iw_u~0.offset, 4); [L35] call write~int(0, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4); [L36] call modf_double_#t~mem4 := read~real(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8); [L36] call write~real(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8); [L36] havoc modf_double_#t~mem4; [L33] call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset); [L33] havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L38] modf_double_#res := modf_double_~x; VAL [#NULL.base=0, #NULL.offset=0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L146] main_#t~ret28 := modf_double_#res; [L146] main_~res~0 := main_#t~ret28; [L146] havoc main_#t~ret28; [L149] call main_#t~mem29 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 8); [L149] isinf_double_#in~x := main_#t~mem29; [L149] havoc isinf_double_#res; [L149] havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L111-L123] isinf_double_~x := isinf_double_#in~x; [L112] havoc isinf_double_~hx~0; [L112] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L114] call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L116] call isinf_double_#t~mem21 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4); [L116] isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L116] havoc isinf_double_#t~union22; [L116] havoc isinf_double_#t~mem21; [L117] call isinf_double_#t~mem23 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4); [L117] isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L117] havoc isinf_double_#t~mem23; [L117] havoc isinf_double_#t~union24; [L114] call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset); [L114] havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_~hx~0=9402, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L119] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L120] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L122] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] main_#t~ret30 := isinf_double_#res; [L149] assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647; [L149] main_#t~short33 := 0 != main_#t~ret30; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] assume main_#t~short33; [L149] main_#t~short32 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] assume !main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] main_#t~short33 := !main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149-L152] assume main_#t~short33; [L149] havoc main_#t~mem29; [L149] havoc main_#t~ret30; [L149] havoc main_#t~short33; [L149] havoc main_#t~ret31; [L149] havoc main_#t~short32; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0.base=3, main_~#iptr~0.offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr.base=3, modf_double_#in~iptr.offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr.base=3, modf_double_~iptr.offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; [?] havoc main_#res; [?] havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0, main_~res~0; [L144] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call main_~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(main_#t~nondet27, main_~#iptr~0, 8); [L145] havoc main_#t~nondet27; [L146] modf_double_#in~x, modf_double_#in~iptr := main_~x~0, main_~#iptr~0; [L146] havoc modf_double_#res; [L146] havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0, modf_double_#t~mem4, modf_double_~#iw_u~0, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0, modf_double_#t~mem7, modf_double_#t~union8, modf_double_~#iw_u~1, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1, modf_double_#t~mem13, modf_double_#t~union14, modf_double_~#iw_u~3, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2, modf_double_#t~mem17, modf_double_#t~union18, modf_double_~#iw_u~4, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0; [L20-L108] modf_double_~x := modf_double_#in~x; [L20-L108] modf_double_~iptr := modf_double_#in~iptr; [L21] havoc modf_double_~i0~0; [L21] havoc modf_double_~i1~0; [L21] havoc modf_double_~j0~0; [L22] havoc modf_double_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L24] FCALL call modf_double_~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(modf_double_~x, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L26] FCALL call modf_double_#t~mem0 := read~int({ base: modf_double_~#ew_u~0!base, offset: 4 + modf_double_~#ew_u~0!offset }, 4); [L26] modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(modf_double_#t~union1, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L26] havoc modf_double_#t~union1; [L26] havoc modf_double_#t~mem0; [L27] FCALL call modf_double_#t~mem2 := read~int({ base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 4); [L27] modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(modf_double_#t~union3, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L27] havoc modf_double_#t~union3; [L27] havoc modf_double_#t~mem2; [L24] FCALL call ULTIMATE.dealloc(modf_double_~#ew_u~0); [L24] havoc modf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L29] modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L30] COND TRUE modf_double_~j0~0 < 20 VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L31] COND TRUE modf_double_~j0~0 < 0 VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L33] FCALL call modf_double_~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), { base: modf_double_~#iw_u~0!base, offset: 4 + modf_double_~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: modf_double_~#iw_u~0!base, offset: modf_double_~#iw_u~0!offset }, 4); [L36] FCALL call modf_double_#t~mem4 := read~real({ base: modf_double_~#iw_u~0!base, offset: modf_double_~#iw_u~0!offset }, 8); [L36] FCALL call write~real(modf_double_#t~mem4, modf_double_~iptr, 8); [L36] havoc modf_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(modf_double_~#iw_u~0); [L33] havoc modf_double_~#iw_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L38] modf_double_#res := modf_double_~x; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L146] main_#t~ret28 := modf_double_#res; [L146] main_~res~0 := main_#t~ret28; [L146] havoc main_#t~ret28; [L149] FCALL call main_#t~mem29 := read~real(main_~#iptr~0, 8); [L149] isinf_double_#in~x := main_#t~mem29; [L149] havoc isinf_double_#res; [L149] havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L111-L123] isinf_double_~x := isinf_double_#in~x; [L112] havoc isinf_double_~hx~0; [L112] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L114] FCALL call isinf_double_~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L116] FCALL call isinf_double_#t~mem21 := read~int({ base: isinf_double_~#ew_u~1!base, offset: 4 + isinf_double_~#ew_u~1!offset }, 4); [L116] isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(isinf_double_#t~union22, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L116] havoc isinf_double_#t~union22; [L116] havoc isinf_double_#t~mem21; [L117] FCALL call isinf_double_#t~mem23 := read~int({ base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 4); [L117] isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(isinf_double_#t~union24, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L117] havoc isinf_double_#t~mem23; [L117] havoc isinf_double_#t~union24; [L114] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~1); [L114] havoc isinf_double_~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_~hx~0=9402, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L119] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L120] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L122] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] main_#t~ret30 := isinf_double_#res; [L149] assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647; [L149] main_#t~short33 := 0 != main_#t~ret30; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND TRUE main_#t~short33 [L149] main_#t~short32 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND FALSE !(main_#t~short32) VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] main_#t~short33 := !main_#t~short32; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND TRUE main_#t~short33 [L149] havoc main_#t~mem29; [L149] havoc main_#t~ret30; [L149] havoc main_#t~short33; [L149] havoc main_#t~ret31; [L149] havoc main_#t~short32; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; [?] havoc main_#res; [?] havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0, main_~res~0; [L144] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call main_~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(main_#t~nondet27, main_~#iptr~0, 8); [L145] havoc main_#t~nondet27; [L146] modf_double_#in~x, modf_double_#in~iptr := main_~x~0, main_~#iptr~0; [L146] havoc modf_double_#res; [L146] havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0, modf_double_#t~mem4, modf_double_~#iw_u~0, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0, modf_double_#t~mem7, modf_double_#t~union8, modf_double_~#iw_u~1, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1, modf_double_#t~mem13, modf_double_#t~union14, modf_double_~#iw_u~3, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2, modf_double_#t~mem17, modf_double_#t~union18, modf_double_~#iw_u~4, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0; [L20-L108] modf_double_~x := modf_double_#in~x; [L20-L108] modf_double_~iptr := modf_double_#in~iptr; [L21] havoc modf_double_~i0~0; [L21] havoc modf_double_~i1~0; [L21] havoc modf_double_~j0~0; [L22] havoc modf_double_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L24] FCALL call modf_double_~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(modf_double_~x, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L26] FCALL call modf_double_#t~mem0 := read~int({ base: modf_double_~#ew_u~0!base, offset: 4 + modf_double_~#ew_u~0!offset }, 4); [L26] modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(modf_double_#t~union1, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L26] havoc modf_double_#t~union1; [L26] havoc modf_double_#t~mem0; [L27] FCALL call modf_double_#t~mem2 := read~int({ base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 4); [L27] modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(modf_double_#t~union3, { base: modf_double_~#ew_u~0!base, offset: modf_double_~#ew_u~0!offset }, 8); [L27] havoc modf_double_#t~union3; [L27] havoc modf_double_#t~mem2; [L24] FCALL call ULTIMATE.dealloc(modf_double_~#ew_u~0); [L24] havoc modf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L29] modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~x=0.0, ~one_modf~0=1.0] [L30] COND TRUE modf_double_~j0~0 < 20 VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L31] COND TRUE modf_double_~j0~0 < 0 VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L33] FCALL call modf_double_~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), { base: modf_double_~#iw_u~0!base, offset: 4 + modf_double_~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: modf_double_~#iw_u~0!base, offset: modf_double_~#iw_u~0!offset }, 4); [L36] FCALL call modf_double_#t~mem4 := read~real({ base: modf_double_~#iw_u~0!base, offset: modf_double_~#iw_u~0!offset }, 8); [L36] FCALL call write~real(modf_double_#t~mem4, modf_double_~iptr, 8); [L36] havoc modf_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(modf_double_~#iw_u~0); [L33] havoc modf_double_~#iw_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L38] modf_double_#res := modf_double_~x; VAL [#NULL!base=0, #NULL!offset=0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L146] main_#t~ret28 := modf_double_#res; [L146] main_~res~0 := main_#t~ret28; [L146] havoc main_#t~ret28; [L149] FCALL call main_#t~mem29 := read~real(main_~#iptr~0, 8); [L149] isinf_double_#in~x := main_#t~mem29; [L149] havoc isinf_double_#res; [L149] havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L111-L123] isinf_double_~x := isinf_double_#in~x; [L112] havoc isinf_double_~hx~0; [L112] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L114] FCALL call isinf_double_~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L116] FCALL call isinf_double_#t~mem21 := read~int({ base: isinf_double_~#ew_u~1!base, offset: 4 + isinf_double_~#ew_u~1!offset }, 4); [L116] isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(isinf_double_#t~union22, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L116] havoc isinf_double_#t~union22; [L116] havoc isinf_double_#t~mem21; [L117] FCALL call isinf_double_#t~mem23 := read~int({ base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 4); [L117] isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(isinf_double_#t~union24, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L117] havoc isinf_double_#t~mem23; [L117] havoc isinf_double_#t~union24; [L114] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~1); [L114] havoc isinf_double_~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_~hx~0=9402, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L119] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L120] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L122] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] main_#t~ret30 := isinf_double_#res; [L149] assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647; [L149] main_#t~short33 := 0 != main_#t~ret30; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND TRUE main_#t~short33 [L149] main_#t~short32 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND FALSE !(main_#t~short32) VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] main_#t~short33 := !main_#t~short32; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_#t~mem29=3.0, main_#t~ret30=-1, main_#t~short32=false, main_#t~short33=true, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L149] COND TRUE main_#t~short33 [L149] havoc main_#t~mem29; [L149] havoc main_#t~ret30; [L149] havoc main_#t~short33; [L149] havoc main_#t~ret31; [L149] havoc main_#t~short32; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=3.0, isinf_double_#res=-1, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=7629, isinf_double_~x=3.0, main_~#iptr~0!base=3, main_~#iptr~0!offset=0, main_~res~0=0.0, main_~x~0=0.0, modf_double_#in~iptr!base=3, modf_double_#in~iptr!offset=0, modf_double_#in~x=0.0, modf_double_#res=0.0, modf_double_~i0~0=7065, modf_double_~i1~0=0, modf_double_~iptr!base=3, modf_double_~iptr!offset=0, modf_double_~j0~0=-1, modf_double_~x=0.0, ~one_modf~0=1.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L30] COND TRUE ~j0~0 < 20 VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L31] COND TRUE ~j0~0 < 0 VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L38] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~mem23; [L117] havoc #t~union24; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND TRUE #t~short33 [L149] havoc #t~mem29; [L149] havoc #t~ret30; [L149] havoc #t~short33; [L149] havoc #t~ret31; [L149] havoc #t~short32; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L30] COND TRUE ~j0~0 < 20 VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L31] COND TRUE ~j0~0 < 0 VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L38] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~mem23; [L117] havoc #t~union24; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L149] COND TRUE #t~short33 [L149] havoc #t~mem29; [L149] havoc #t~ret30; [L149] havoc #t~short33; [L149] havoc #t~ret31; [L149] havoc #t~short32; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L18] static const double one_modf = 1.0; [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [one_modf=1] ----- [2018-11-23 11:59:28,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 11:59:28 ImpRootNode [2018-11-23 11:59:28,837 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 11:59:28,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:59:28,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:59:28,837 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:59:28,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:28" (3/4) ... [2018-11-23 11:59:28,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:59:28,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:59:28,842 INFO L168 Benchmark]: Toolchain (without parser) took 1272.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -71.2 MB). Peak memory consumption was 68.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:28,849 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:59:28,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:28,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.80 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:28,851 INFO L168 Benchmark]: Boogie Preprocessor took 30.10 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 11:59:28,851 INFO L168 Benchmark]: RCFGBuilder took 439.11 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:28,852 INFO L168 Benchmark]: CodeCheck took 530.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:28,852 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:59:28,855 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 52 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 6 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 10 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [one_modf=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.80 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.10 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. * RCFGBuilder took 439.11 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * CodeCheck took 530.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. 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 11:59:30,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:59:30,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:59:30,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:59:30,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:59:30,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:59:30,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:59:30,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:59:30,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:59:30,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:59:30,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:59:30,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:59:30,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:59:30,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:59:30,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:59:30,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:59:30,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:59:30,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:59:30,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:59:30,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:59:30,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:59:30,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:59:30,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:59:30,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:59:30,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:59:30,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:59:30,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:59:30,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:59:30,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:59:30,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:59:30,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:59:30,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:59:30,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:59:30,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:59:30,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:59:30,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:59:30,317 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 11:59:30,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:59:30,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:59:30,329 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:59:30,329 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 11:59:30,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:59:30,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:59:30,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:59:30,330 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:59:30,331 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 11:59:30,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:59:30,331 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 11:59:30,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:59:30,332 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:59:30,333 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:59:30,333 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_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak 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 -> Kojak 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2018-11-23 11:59:30,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:59:30,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:59:30,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:59:30,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:59:30,373 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:59:30,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 11:59:30,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/7aa853001/8e67898bb5924561bb9282445e67417f/FLAGc71ea7477 [2018-11-23 11:59:30,751 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:59:30,751 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 11:59:30,755 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/7aa853001/8e67898bb5924561bb9282445e67417f/FLAGc71ea7477 [2018-11-23 11:59:31,173 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/data/7aa853001/8e67898bb5924561bb9282445e67417f [2018-11-23 11:59:31,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:59:31,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:59:31,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:31,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:59:31,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:59:31,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d8ea8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31, skipping insertion in model container [2018-11-23 11:59:31,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:59:31,205 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:59:31,341 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:31,351 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:59:31,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:31,395 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:59:31,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31 WrapperNode [2018-11-23 11:59:31,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:31,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:31,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:59:31,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:59:31,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:31,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:59:31,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:59:31,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:59:31,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... [2018-11-23 11:59:31,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:59:31,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:59:31,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:59:31,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:59:31,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0c77165-c5a8-4770-b000-78dc1170153d/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 11:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 11:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 11:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-11-23 11:59:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:59:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:59:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:59:31,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:59:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:59:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:59:31,674 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,711 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,744 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,813 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,834 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,850 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,868 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,882 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:31,933 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:32,324 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:32,332 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:32,346 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:32,355 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:59:32,402 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:32,402 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 11:59:32,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:32 BoogieIcfgContainer [2018-11-23 11:59:32,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:32,403 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 11:59:32,403 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 11:59:32,413 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 11:59:32,413 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:32,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 48 states and 79 transitions. [2018-11-23 11:59:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2018-11-23 11:59:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:59:32,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,502 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,542 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 11:59:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 48 states and 72 transitions. [2018-11-23 11:59:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2018-11-23 11:59:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:32,552 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,552 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,579 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 11:59:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 48 states and 68 transitions. [2018-11-23 11:59:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2018-11-23 11:59:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:32,586 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,587 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,614 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 11:59:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 48 states and 66 transitions. [2018-11-23 11:59:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2018-11-23 11:59:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:32,619 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,620 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,645 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 11:59:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 48 states and 64 transitions. [2018-11-23 11:59:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2018-11-23 11:59:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:59:32,651 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,652 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,695 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 11:59:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 49 states and 65 transitions. [2018-11-23 11:59:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2018-11-23 11:59:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:59:32,730 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:32,731 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,887 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 11:59:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2018-11-23 11:59:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-23 11:59:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:59:33,091 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:33,092 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:33,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:33,116 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 11:59:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 36 states and 41 transitions. [2018-11-23 11:59:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:59:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:59:33,120 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:33,121 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:33,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:33,206 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 11:59:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2018-11-23 11:59:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:59:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:59:37,424 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:37,425 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:37,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:37,548 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 51 treesize of output 45 [2018-11-23 11:59:37,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 38 [2018-11-23 11:59:37,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 11:59:37,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:37,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:37,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:37,575 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 11:59:37,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 11:59:37,703 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 11:59:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 27 states and 29 transitions. [2018-11-23 11:59:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:59:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:59:38,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:38,927 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:38,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:38,972 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 11:59:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 11:59:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:59:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:59:38,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 11:59:38,977 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 11:59:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:39,108 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:59:39,109 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:59:39,110 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 11:59:39,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:59:39,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:59:39,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 11:59:39,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,160 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 11:59:39,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:59:39,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 11:59:39,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,172 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 11:59:39,178 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 11:59:39,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:19 [2018-11-23 11:59:39,233 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 54 treesize of output 48 [2018-11-23 11:59:39,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 48 treesize of output 39 [2018-11-23 11:59:39,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:59:39,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:59:39,260 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 11:59:39,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:69, output treesize:39 [2018-11-23 11:59:39,681 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 11:59:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 11:59:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 11:59:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 11:59:50,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:50,779 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 12 iterations. [2018-11-23 11:59:50,784 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 11:59:50,858 INFO L579 CodeCheckObserver]: Invariant with dag size 24 [2018-11-23 11:59:50,860 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.reportResult(CodeCheckObserver.java:815) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createInvariantResults(CodeCheckObserver.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:539) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:59:50,862 INFO L168 Benchmark]: Toolchain (without parser) took 19685.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -103.3 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:50,863 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:59:50,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.41 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 11:59:50,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:50,864 INFO L168 Benchmark]: Boogie Preprocessor took 82.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:50,864 INFO L168 Benchmark]: RCFGBuilder took 887.28 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:50,865 INFO L168 Benchmark]: CodeCheck took 18458.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2018-11-23 11:59:50,868 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 52 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 12 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36368 SDtfs, 338 SDslu, 240 SDs, 0 SdLazy, 2226 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 1445 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 187 ConstructedInterpolants, 28 QuantifiedInterpolants, 21060 SizeOfPredicates, 28 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.41 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 36.32 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 887.28 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * CodeCheck took 18458.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...