./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_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_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/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 dbff84b908ff01b4d2841315a486ca175d7dad80 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/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 dbff84b908ff01b4d2841315a486ca175d7dad80 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:53:59,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:53:59,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:53:59,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:53:59,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:53:59,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:53:59,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:53:59,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:53:59,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:53:59,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:53:59,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:53:59,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:53:59,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:53:59,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:53:59,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:53:59,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:53:59,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:53:59,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:53:59,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:53:59,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:53:59,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:53:59,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:53:59,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:53:59,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:53:59,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:53:59,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:53:59,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:53:59,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:53:59,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:53:59,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:53:59,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:53:59,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:53:59,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:53:59,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:53:59,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:53:59,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:53:59,973 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 07:53:59,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:53:59,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:53:59,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:53:59,983 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:53:59,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:53:59,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:53:59,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:53:59,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:53:59,985 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:53:59,987 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:53:59,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:53:59,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:53:59,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:53:59,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:53:59,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:53:59,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:53:59,989 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:53:59,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:53:59,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:53:59,989 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_4a503ec7-169b-442e-b479-35b3df35df75/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 -> dbff84b908ff01b4d2841315a486ca175d7dad80 [2018-11-23 07:54:00,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:54:00,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:54:00,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:54:00,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:54:00,030 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:54:00,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 07:54:00,078 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/6576a648d/f5c75a03857b496db95cabd6971ebd99/FLAGddbc54e23 [2018-11-23 07:54:00,383 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:54:00,383 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 07:54:00,387 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/6576a648d/f5c75a03857b496db95cabd6971ebd99/FLAGddbc54e23 [2018-11-23 07:54:00,396 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/6576a648d/f5c75a03857b496db95cabd6971ebd99 [2018-11-23 07:54:00,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:54:00,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:54:00,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:00,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:54:00,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:54:00,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00, skipping insertion in model container [2018-11-23 07:54:00,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:54:00,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:54:00,539 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:00,541 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:54:00,560 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:00,572 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:54:00,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00 WrapperNode [2018-11-23 07:54:00,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:00,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:00,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:54:00,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:54:00,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:00,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:54:00,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:54:00,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:54:00,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:00,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:54:00,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:54:00,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:54:00,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:54:00,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/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 07:54:00,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 07:54:00,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:54:00,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 07:54:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:54:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:54:00,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:54:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:54:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:54:00,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:54:00,986 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 07:54:00,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:00 BoogieIcfgContainer [2018-11-23 07:54:00,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:54:00,986 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:54:00,986 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:54:00,995 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:54:00,995 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:00" (1/1) ... [2018-11-23 07:54:01,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 24 states and 38 transitions. [2018-11-23 07:54:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2018-11-23 07:54:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:54:01,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:54:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:01,098 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 07:54:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 24 states and 33 transitions. [2018-11-23 07:54:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-11-23 07:54:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 07:54:01,108 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:54:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:01,296 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret14, main_#t~ret15, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0);trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4);trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);havoc trunc_double_#t~mem0;havoc trunc_double_#t~union1;call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume trunc_double_~exponent_less_1023~0 > 51; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume 1024 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] main_#t~ret14 := trunc_double_#res;main_~res~0 := main_#t~ret14;havoc main_#t~ret14;isinf_double_#in~x := main_~res~0;havoc isinf_double_#res;havoc isinf_double_#t~mem10, isinf_double_#t~union11, isinf_double_#t~mem12, isinf_double_#t~union13, 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=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.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~mem10 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem10 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem10 % 4294967296 % 4294967296 else isinf_double_#t~mem10 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union11, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~union11;havoc isinf_double_#t~mem10;call isinf_double_#t~mem12 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem12 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem12 % 4294967296 % 4294967296 else isinf_double_#t~mem12 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union13, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~mem12;havoc isinf_double_#t~union13;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=6878, ULTIMATE.start_isinf_double_~lx~0=8221, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.0] [?] goto; VAL [ULTIMATE.start_isinf_double_~hx~0=6878, ULTIMATE.start_isinf_double_~lx~0=8221, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.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~ret15 := isinf_double_#res;assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647; VAL [ULTIMATE.start_isinf_double_~hx~0=(- 2148530629), ULTIMATE.start_isinf_double_~lx~0=8221, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_main_#t~ret15|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.0] [?] assume 0 == main_#t~ret15;havoc main_#t~ret15; VAL [ULTIMATE.start_isinf_double_~hx~0=(- 2148530629), ULTIMATE.start_isinf_double_~lx~0=8221, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.0] [?] assume !false; VAL [ULTIMATE.start_isinf_double_~hx~0=(- 2148530629), ULTIMATE.start_isinf_double_~lx~0=8221, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=9531, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=6.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret14, main_#t~ret15, main_~x~0, main_~res~0; [L84] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L85] trunc_double_#in~x := main_~x~0; [L85] havoc trunc_double_#res; [L85] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] havoc trunc_double_#t~mem0; [L25] havoc trunc_double_#t~union1; [L26] call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset); [L23] havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L30-L58] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L47-L58] assume trunc_double_~exponent_less_1023~0 > 51; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L48-L50] assume 1024 == trunc_double_~exponent_less_1023~0; [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L85] main_#t~ret14 := trunc_double_#res; [L85] main_~res~0 := main_#t~ret14; [L85] havoc main_#t~ret14; [L88] isinf_double_#in~x := main_~res~0; [L88] havoc isinf_double_#res; [L88] havoc isinf_double_#t~mem10, isinf_double_#t~union11, isinf_double_#t~mem12, isinf_double_#t~union13, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L63-L75] isinf_double_~x := isinf_double_#in~x; [L64] havoc isinf_double_~hx~0; [L64] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L66] call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.alloc(8); [L67] call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L68] call isinf_double_#t~mem10 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4); [L68] isinf_double_~hx~0 := (if isinf_double_#t~mem10 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem10 % 4294967296 % 4294967296 else isinf_double_#t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] call write~real(isinf_double_#t~union11, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L68] havoc isinf_double_#t~union11; [L68] havoc isinf_double_#t~mem10; [L69] call isinf_double_#t~mem12 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4); [L69] isinf_double_~lx~0 := (if isinf_double_#t~mem12 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem12 % 4294967296 % 4294967296 else isinf_double_#t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(isinf_double_#t~union13, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L69] havoc isinf_double_#t~mem12; [L69] havoc isinf_double_#t~union13; [L66] call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset); [L66] havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_~hx~0=6878, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L71] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L72] 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); [L73] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L74] 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); [L88] main_#t~ret15 := isinf_double_#res; [L88] assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_#t~ret15=0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L88-L91] assume 0 == main_#t~ret15; [L88] havoc main_#t~ret15; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L89] assert false; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret14, main_#t~ret15, main_~x~0, main_~res~0; [L84] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L85] trunc_double_#in~x := main_~x~0; [L85] havoc trunc_double_#res; [L85] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] havoc trunc_double_#t~mem0; [L25] havoc trunc_double_#t~union1; [L26] call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset); [L23] havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L30-L58] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L47-L58] assume trunc_double_~exponent_less_1023~0 > 51; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L48-L50] assume 1024 == trunc_double_~exponent_less_1023~0; [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L85] main_#t~ret14 := trunc_double_#res; [L85] main_~res~0 := main_#t~ret14; [L85] havoc main_#t~ret14; [L88] isinf_double_#in~x := main_~res~0; [L88] havoc isinf_double_#res; [L88] havoc isinf_double_#t~mem10, isinf_double_#t~union11, isinf_double_#t~mem12, isinf_double_#t~union13, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L63-L75] isinf_double_~x := isinf_double_#in~x; [L64] havoc isinf_double_~hx~0; [L64] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L66] call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.alloc(8); [L67] call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L68] call isinf_double_#t~mem10 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4); [L68] isinf_double_~hx~0 := (if isinf_double_#t~mem10 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem10 % 4294967296 % 4294967296 else isinf_double_#t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] call write~real(isinf_double_#t~union11, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L68] havoc isinf_double_#t~union11; [L68] havoc isinf_double_#t~mem10; [L69] call isinf_double_#t~mem12 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4); [L69] isinf_double_~lx~0 := (if isinf_double_#t~mem12 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem12 % 4294967296 % 4294967296 else isinf_double_#t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(isinf_double_#t~union13, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8); [L69] havoc isinf_double_#t~mem12; [L69] havoc isinf_double_#t~union13; [L66] call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset); [L66] havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_~hx~0=6878, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L71] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L72] 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); [L73] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L74] 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); [L88] main_#t~ret15 := isinf_double_#res; [L88] assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_#t~ret15=0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L88-L91] assume 0 == main_#t~ret15; [L88] havoc main_#t~ret15; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L89] assert false; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret14, main_#t~ret15, main_~x~0, main_~res~0; [L84] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L85] trunc_double_#in~x := main_~x~0; [L85] havoc trunc_double_#res; [L85] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0, trunc_double_#t~mem4, trunc_double_#t~union5, trunc_double_~#iw_u~0, trunc_double_#t~mem6, trunc_double_#t~union7, trunc_double_~#iw_u~1, trunc_double_#t~mem8, trunc_double_#t~union9, trunc_double_~#iw_u~2, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] FCALL call trunc_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(trunc_double_~x, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] FCALL call trunc_double_#t~mem0 := read~int({ base: trunc_double_~#ew_u~0!base, offset: 4 + trunc_double_~#ew_u~0!offset }, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(trunc_double_#t~union1, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] havoc trunc_double_#t~mem0; [L25] havoc trunc_double_#t~union1; [L26] FCALL call trunc_double_#t~mem2 := read~int({ base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] FCALL call write~real(trunc_double_#t~union3, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(trunc_double_~#ew_u~0); [L23] havoc trunc_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L30] COND FALSE !(trunc_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L47] COND TRUE trunc_double_~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L48] COND TRUE 1024 == trunc_double_~exponent_less_1023~0 [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L85] main_#t~ret14 := trunc_double_#res; [L85] main_~res~0 := main_#t~ret14; [L85] havoc main_#t~ret14; [L88] isinf_double_#in~x := main_~res~0; [L88] havoc isinf_double_#res; [L88] havoc isinf_double_#t~mem10, isinf_double_#t~union11, isinf_double_#t~mem12, isinf_double_#t~union13, isinf_double_~#ew_u~1, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L63-L75] isinf_double_~x := isinf_double_#in~x; [L64] havoc isinf_double_~hx~0; [L64] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L66] FCALL call isinf_double_~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L68] FCALL call isinf_double_#t~mem10 := read~int({ base: isinf_double_~#ew_u~1!base, offset: 4 + isinf_double_~#ew_u~1!offset }, 4); [L68] isinf_double_~hx~0 := (if isinf_double_#t~mem10 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem10 % 4294967296 % 4294967296 else isinf_double_#t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(isinf_double_#t~union11, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L68] havoc isinf_double_#t~union11; [L68] havoc isinf_double_#t~mem10; [L69] FCALL call isinf_double_#t~mem12 := read~int({ base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 4); [L69] isinf_double_~lx~0 := (if isinf_double_#t~mem12 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem12 % 4294967296 % 4294967296 else isinf_double_#t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(isinf_double_#t~union13, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L69] havoc isinf_double_#t~mem12; [L69] havoc isinf_double_#t~union13; [L66] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~1); [L66] havoc isinf_double_~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_~hx~0=6878, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L71] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L72] 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); [L73] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L74] 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); [L88] main_#t~ret15 := isinf_double_#res; [L88] assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_#t~ret15=0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L88] COND TRUE 0 == main_#t~ret15 [L88] havoc main_#t~ret15; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret14, main_#t~ret15, main_~x~0, main_~res~0; [L84] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L85] trunc_double_#in~x := main_~x~0; [L85] havoc trunc_double_#res; [L85] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0, trunc_double_#t~mem4, trunc_double_#t~union5, trunc_double_~#iw_u~0, trunc_double_#t~mem6, trunc_double_#t~union7, trunc_double_~#iw_u~1, trunc_double_#t~mem8, trunc_double_#t~union9, trunc_double_~#iw_u~2, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] FCALL call trunc_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(trunc_double_~x, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] FCALL call trunc_double_#t~mem0 := read~int({ base: trunc_double_~#ew_u~0!base, offset: 4 + trunc_double_~#ew_u~0!offset }, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(trunc_double_#t~union1, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] havoc trunc_double_#t~mem0; [L25] havoc trunc_double_#t~union1; [L26] FCALL call trunc_double_#t~mem2 := read~int({ base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] FCALL call write~real(trunc_double_#t~union3, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(trunc_double_~#ew_u~0); [L23] havoc trunc_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L30] COND FALSE !(trunc_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L47] COND TRUE trunc_double_~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L48] COND TRUE 1024 == trunc_double_~exponent_less_1023~0 [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L85] main_#t~ret14 := trunc_double_#res; [L85] main_~res~0 := main_#t~ret14; [L85] havoc main_#t~ret14; [L88] isinf_double_#in~x := main_~res~0; [L88] havoc isinf_double_#res; [L88] havoc isinf_double_#t~mem10, isinf_double_#t~union11, isinf_double_#t~mem12, isinf_double_#t~union13, isinf_double_~#ew_u~1, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L63-L75] isinf_double_~x := isinf_double_#in~x; [L64] havoc isinf_double_~hx~0; [L64] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L66] FCALL call isinf_double_~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L68] FCALL call isinf_double_#t~mem10 := read~int({ base: isinf_double_~#ew_u~1!base, offset: 4 + isinf_double_~#ew_u~1!offset }, 4); [L68] isinf_double_~hx~0 := (if isinf_double_#t~mem10 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem10 % 4294967296 % 4294967296 else isinf_double_#t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(isinf_double_#t~union11, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L68] havoc isinf_double_#t~union11; [L68] havoc isinf_double_#t~mem10; [L69] FCALL call isinf_double_#t~mem12 := read~int({ base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 4); [L69] isinf_double_~lx~0 := (if isinf_double_#t~mem12 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem12 % 4294967296 % 4294967296 else isinf_double_#t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(isinf_double_#t~union13, { base: isinf_double_~#ew_u~1!base, offset: isinf_double_~#ew_u~1!offset }, 8); [L69] havoc isinf_double_#t~mem12; [L69] havoc isinf_double_#t~union13; [L66] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~1); [L66] havoc isinf_double_~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_~hx~0=6878, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L71] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L72] 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); [L73] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L74] 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); [L88] main_#t~ret15 := isinf_double_#res; [L88] assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_#t~ret15=0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L88] COND TRUE 0 == main_#t~ret15 [L88] havoc main_#t~ret15; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=-2148530629, isinf_double_~lx~0=8221, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=6.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=9531, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#NULL!base=0, #NULL!offset=0] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~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); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #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); [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#NULL!base=0, #NULL!offset=0] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~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); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #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); [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L84] double x = -1.0 / 0.0; [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L30] COND FALSE !(exponent_less_1023 < 20) [L47] COND TRUE exponent_less_1023 > 51 [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; [L85] double res = trunc_double(x); [L64] __int32_t hx, lx; [L66] ieee_double_shape_type ew_u; [L67] ew_u.value = (x) [L68] EXPR ew_u.parts.msw [L68] (hx) = ew_u.parts.msw [L69] EXPR ew_u.parts.lsw [L69] (lx) = ew_u.parts.lsw [L71] hx &= 0x7fffffff [L72] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L73] hx = 0x7ff00000 - hx [L74] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L88] COND TRUE !isinf_double(res) [L89] __VERIFIER_error() ----- [2018-11-23 07:54:01,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:54:01 ImpRootNode [2018-11-23 07:54:01,343 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:54:01,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:54:01,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:54:01,344 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:54:01,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:00" (3/4) ... [2018-11-23 07:54:01,347 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:54:01,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:54:01,347 INFO L168 Benchmark]: Toolchain (without parser) took 948.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,349 INFO L168 Benchmark]: CDTParser took 0.17 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 07:54:01,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.21 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,350 INFO L168 Benchmark]: Boogie Preprocessor took 62.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,351 INFO L168 Benchmark]: RCFGBuilder took 316.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,351 INFO L168 Benchmark]: CodeCheck took 356.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:01,351 INFO L168 Benchmark]: Witness Printer took 3.61 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 07:54:01,355 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, 27 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: 89]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 72, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of bitwiseAnd at line 71. Possible FailurePath: [L84] double x = -1.0 / 0.0; [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L30] COND FALSE !(exponent_less_1023 < 20) [L47] COND TRUE exponent_less_1023 > 51 [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; [L85] double res = trunc_double(x); [L64] __int32_t hx, lx; [L66] ieee_double_shape_type ew_u; [L67] ew_u.value = (x) [L68] EXPR ew_u.parts.msw [L68] (hx) = ew_u.parts.msw [L69] EXPR ew_u.parts.lsw [L69] (lx) = ew_u.parts.lsw [L71] hx &= 0x7fffffff [L72] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L73] hx = 0x7ff00000 - hx [L74] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L88] COND TRUE !isinf_double(res) [L89] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.21 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * CodeCheck took 356.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 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. 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 07:54:02,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:54:02,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:54:02,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:54:02,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:54:02,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:54:02,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:54:02,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:54:02,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:54:02,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:54:02,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:54:02,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:54:02,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:54:02,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:54:02,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:54:02,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:54:02,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:54:02,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:54:02,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:54:02,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:54:02,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:54:02,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:54:02,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:54:02,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:54:02,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:54:02,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:54:02,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:54:02,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:54:02,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:54:02,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:54:02,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:54:02,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:54:02,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:54:02,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:54:02,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:54:02,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:54:02,872 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 07:54:02,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:54:02,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:54:02,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:54:02,885 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:54:02,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:54:02,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:54:02,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:54:02,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:54:02,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:54:02,887 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:54:02,888 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:54:02,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:54:02,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:54:02,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:54:02,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:54:02,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 07:54:02,889 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 07:54:02,889 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_4a503ec7-169b-442e-b479-35b3df35df75/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 -> dbff84b908ff01b4d2841315a486ca175d7dad80 [2018-11-23 07:54:02,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:54:02,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:54:02,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:54:02,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:54:02,932 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:54:02,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 07:54:02,970 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/9116466a4/cc63d721f5d542a49b7b69c76d6d9ba1/FLAGead6201ae [2018-11-23 07:54:03,383 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:54:03,383 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 07:54:03,388 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/9116466a4/cc63d721f5d542a49b7b69c76d6d9ba1/FLAGead6201ae [2018-11-23 07:54:03,398 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/data/9116466a4/cc63d721f5d542a49b7b69c76d6d9ba1 [2018-11-23 07:54:03,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:54:03,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:54:03,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:03,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:54:03,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:54:03,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bad2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03, skipping insertion in model container [2018-11-23 07:54:03,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:54:03,434 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:54:03,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:03,590 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:54:03,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:03,634 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:54:03,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03 WrapperNode [2018-11-23 07:54:03,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:03,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:03,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:54:03,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:54:03,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:03,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:54:03,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:54:03,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:54:03,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... [2018-11-23 07:54:03,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:54:03,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:54:03,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:54:03,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:54:03,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/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 07:54:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 07:54:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 07:54:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:54:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 07:54:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:54:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:54:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 07:54:03,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:54:03,904 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 07:54:03,940 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 07:54:04,073 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:54:04,073 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 07:54:04,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:04 BoogieIcfgContainer [2018-11-23 07:54:04,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:54:04,074 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:54:04,074 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:54:04,081 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:54:04,081 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:04" (1/1) ... [2018-11-23 07:54:04,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 24 states and 38 transitions. [2018-11-23 07:54:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2018-11-23 07:54:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:54:04,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:54:04,147 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:54:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:04,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:04,175 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 07:54:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 24 states and 33 transitions. [2018-11-23 07:54:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-11-23 07:54:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 07:54:04,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:54:04,184 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:54:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:04,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:04,325 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:54:04,325 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:54:04,329 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 07:54:04,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:54:04,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:54:04,393 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 07:54:04,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:54:04,413 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 07:54:04,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:54:04,424 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 07:54:04,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:54:04,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:54:04,444 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 07:54:04,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 07:54:04,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:33 [2018-11-23 07:54:04,561 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 07:54:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 29 states and 40 transitions. [2018-11-23 07:54:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-11-23 07:54:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:54:05,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:54:05,340 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:54:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:05,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:05,370 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:54:05,370 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:54:05,371 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 07:54:05,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:54:05,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2018-11-23 07:54:05,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:54:05,427 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 07:54:05,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:54:05,432 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 10 [2018-11-23 07:54:05,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:54:05,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:54:05,444 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 07:54:05,452 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 07:54:05,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:20 [2018-11-23 07:54:05,641 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 07:54:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:54:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 07:54:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 07:54:06,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:54:06,428 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 4 iterations. [2018-11-23 07:54:06,435 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 07:54:06,499 INFO L579 CodeCheckObserver]: Invariant with dag size 9 [2018-11-23 07:54:06,503 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,503 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,503 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,506 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,508 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 07:54:06,508 INFO L579 CodeCheckObserver]: Invariant with dag size 21 [2018-11-23 07:54:06,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,514 INFO L579 CodeCheckObserver]: Invariant with dag size 8 [2018-11-23 07:54:06,516 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,516 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,517 INFO L579 CodeCheckObserver]: Invariant with dag size 9 [2018-11-23 07:54:06,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:54:06 ImpRootNode [2018-11-23 07:54:06,521 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:54:06,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:54:06,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:54:06,521 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:54:06,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:04" (3/4) ... [2018-11-23 07:54:06,525 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:54:06,534 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 07:54:06,534 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 07:54:06,535 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:54:06,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) [2018-11-23 07:54:06,553 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_q#valueAsBitvector_3 : bv64 :: (v_q#valueAsBitvector_3[31:0] == lx && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0])) && v_q#valueAsBitvector_3[63:32] == hx) [2018-11-23 07:54:06,574 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a503ec7-169b-442e-b479-35b3df35df75/bin-2019/ukojak/witness.graphml [2018-11-23 07:54:06,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:54:06,575 INFO L168 Benchmark]: Toolchain (without parser) took 3173.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 948.7 MB in the beginning and 962.7 MB in the end (delta: -14.0 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:06,576 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:54:06,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.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 07:54:06,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.30 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:54:06,577 INFO L168 Benchmark]: Boogie Preprocessor took 69.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:06,577 INFO L168 Benchmark]: RCFGBuilder took 338.79 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:06,578 INFO L168 Benchmark]: CodeCheck took 2446.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.5 MB in the end (delta: 143.7 MB). Peak memory consumption was 143.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:06,578 INFO L168 Benchmark]: Witness Printer took 53.48 ms. Allocated memory is still 1.2 GB. Free memory was 969.5 MB in the beginning and 962.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:06,580 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, 27 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 4 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 60 SDslu, 48 SDs, 0 SdLazy, 148 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 8 QuantifiedInterpolants, 4619 SizeOfPredicates, 15 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 89]: 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 - InvariantResult [Line: 17]: Loop Invariant [2018-11-23 07:54:06,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,583 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant [2018-11-23 07:54:06,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,583 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,583 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,585 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,585 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,585 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 07:54:06,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_3 : bv64 :: (v_q#valueAsBitvector_3[31:0] == lx && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0])) && v_q#valueAsBitvector_3[63:32] == hx) - InvariantResult [Line: 22]: Loop Invariant [2018-11-23 07:54:06,587 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,587 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,587 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,587 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 65]: Loop Invariant [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,588 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:54:06,589 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.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 29.30 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 338.79 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * CodeCheck took 2446.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.5 MB in the end (delta: 143.7 MB). Peak memory consumption was 143.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.48 ms. Allocated memory is still 1.2 GB. Free memory was 969.5 MB in the beginning and 962.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! Received shutdown request...