./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1072b_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_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 08:36:11,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:36:11,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:36:11,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:36:11,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:36:11,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:36:11,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:36:11,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:36:11,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:36:11,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:36:11,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:36:11,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:36:11,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:36:11,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:36:11,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:36:11,424 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:36:11,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:36:11,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:36:11,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:36:11,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:36:11,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:36:11,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:36:11,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:36:11,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:36:11,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:36:11,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:36:11,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:36:11,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:36:11,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:36:11,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:36:11,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:36:11,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:36:11,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:36:11,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:36:11,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:36:11,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:36:11,437 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 08:36:11,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:36:11,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:36:11,448 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:36:11,448 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:36:11,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:36:11,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:36:11,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:36:11,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:36:11,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:36:11,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:36:11,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:36:11,451 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:36:11,451 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:36:11,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:36:11,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:36:11,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:36:11,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:36:11,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2018-11-23 08:36:11,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:36:11,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:36:11,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:36:11,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:36:11,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:36:11,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-11-23 08:36:11,519 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/4e586d88b/fbdfcf62d0c7456d915af6758dad7a92/FLAGbf3119133 [2018-11-23 08:36:11,916 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:36:11,916 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-11-23 08:36:11,921 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/4e586d88b/fbdfcf62d0c7456d915af6758dad7a92/FLAGbf3119133 [2018-11-23 08:36:11,931 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/4e586d88b/fbdfcf62d0c7456d915af6758dad7a92 [2018-11-23 08:36:11,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:36:11,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:36:11,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:11,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:36:11,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:36:11,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:11" (1/1) ... [2018-11-23 08:36:11,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ba3d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:11, skipping insertion in model container [2018-11-23 08:36:11,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:11" (1/1) ... [2018-11-23 08:36:11,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:36:11,958 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:36:12,075 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:12,077 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:36:12,096 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:12,109 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:36:12,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12 WrapperNode [2018-11-23 08:36:12,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:12,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:12,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:36:12,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:36:12,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:12,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:36:12,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:36:12,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:36:12,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:36:12,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:36:12,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:36:12,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:36:12,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:36:12,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:36:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:36:12,453 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:36:12,453 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 08:36:12,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:12 BoogieIcfgContainer [2018-11-23 08:36:12,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:36:12,454 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:36:12,454 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:36:12,460 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:36:12,460 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:12" (1/1) ... [2018-11-23 08:36:12,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 25 states and 40 transitions. [2018-11-23 08:36:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2018-11-23 08:36:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:36:12,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:12,552 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 08:36:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 25 states and 37 transitions. [2018-11-23 08:36:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2018-11-23 08:36:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 08:36:12,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:12,650 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~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~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~union1;havoc trunc_double_#t~mem0;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~union3;havoc trunc_double_#t~mem2;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=3, 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=3, 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=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, 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=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, 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=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, 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=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~short14|=false, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] assume !main_#t~short14; VAL [ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~short14|=false, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] assume !main_#t~short14;havoc main_#t~ret13;havoc main_#t~short14; VAL [ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] assume !false; VAL [ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=3, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=2282, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0; [L81] main_~x~0 := 0.0; [L82] trunc_double_#in~x := main_~x~0; [L82] havoc trunc_double_#res; [L82] 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~union1; [L25] havoc trunc_double_#t~mem0; [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~union3; [L26] havoc trunc_double_#t~mem2; [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=3, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L82] main_#t~ret12 := trunc_double_#res; [L82] main_~res~0 := main_#t~ret12; [L82] havoc main_#t~ret12; [L85] main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] assume !main_#t~short14; VAL [#NULL.base=0, #NULL.offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85-L88] assume !main_#t~short14; [L85] havoc main_#t~ret13; [L85] havoc main_#t~short14; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L86] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0; [L81] main_~x~0 := 0.0; [L82] trunc_double_#in~x := main_~x~0; [L82] havoc trunc_double_#res; [L82] 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~union1; [L25] havoc trunc_double_#t~mem0; [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~union3; [L26] havoc trunc_double_#t~mem2; [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=3, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L82] main_#t~ret12 := trunc_double_#res; [L82] main_~res~0 := main_#t~ret12; [L82] havoc main_#t~ret12; [L85] main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] assume !main_#t~short14; VAL [#NULL.base=0, #NULL.offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85-L88] assume !main_#t~short14; [L85] havoc main_#t~ret13; [L85] havoc main_#t~short14; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L86] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0; [L81] main_~x~0 := 0.0; [L82] trunc_double_#in~x := main_~x~0; [L82] havoc trunc_double_#res; [L82] 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~union1; [L25] havoc trunc_double_#t~mem0; [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~union3; [L26] havoc trunc_double_#t~mem2; [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=3, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L82] main_#t~ret12 := trunc_double_#res; [L82] main_~res~0 := main_#t~ret12; [L82] havoc main_#t~ret12; [L85] main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] COND FALSE !(main_#t~short14) VAL [#NULL!base=0, #NULL!offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] COND TRUE !main_#t~short14 [L85] havoc main_#t~ret13; [L85] havoc main_#t~short14; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0; [L81] main_~x~0 := 0.0; [L82] trunc_double_#in~x := main_~x~0; [L82] havoc trunc_double_#res; [L82] 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~union1; [L25] havoc trunc_double_#t~mem0; [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~union3; [L26] havoc trunc_double_#t~mem2; [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=3, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, 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=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L82] main_#t~ret12 := trunc_double_#res; [L82] main_~res~0 := main_#t~ret12; [L82] havoc main_#t~ret12; [L85] main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] COND FALSE !(main_#t~short14) VAL [#NULL!base=0, #NULL!offset=0, main_#t~short14=false, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L85] COND TRUE !main_#t~short14 [L85] havoc main_#t~ret13; [L85] havoc main_#t~short14; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=3, trunc_double_~msw~0=0, trunc_double_~signbit~0=2282, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L81] ~x~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~union1; [L25] havoc #t~mem0; [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~union3; [L26] havoc #t~mem2; [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] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0] [L86] 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; [L81] ~x~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~union1; [L25] havoc #t~mem0; [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~union3; [L26] havoc #t~mem2; [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] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L81] double x = 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; [L82] double res = trunc_double(x); [L85] EXPR res == 0.0 && __signbit_double(res) == 0 [L85] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L86] __VERIFIER_error() ----- [2018-11-23 08:36:12,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:36:12 ImpRootNode [2018-11-23 08:36:12,680 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 08:36:12,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:36:12,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:36:12,681 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:36:12,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:12" (3/4) ... [2018-11-23 08:36:12,684 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:36:12,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:36:12,686 INFO L168 Benchmark]: Toolchain (without parser) took 753.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,688 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:36:12,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.12 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,689 INFO L168 Benchmark]: Boogie Preprocessor took 18.86 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,690 INFO L168 Benchmark]: RCFGBuilder took 265.02 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,691 INFO L168 Benchmark]: CodeCheck took 226.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:12,691 INFO L168 Benchmark]: Witness Printer took 3.64 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 08:36:12,694 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, 28 locations, 1 error locations. UNSAFE Result, 0.1s 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, 67 GetRequests, 67 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, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 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: 86]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L81] double x = 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; [L82] double res = trunc_double(x); [L85] EXPR res == 0.0 && __signbit_double(res) == 0 [L85] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L86] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.12 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 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 59.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.86 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.02 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * CodeCheck took 226.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 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 08:36:14,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:36:14,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:36:14,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:36:14,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:36:14,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:36:14,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:36:14,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:36:14,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:36:14,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:36:14,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:36:14,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:36:14,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:36:14,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:36:14,078 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:36:14,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:36:14,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:36:14,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:36:14,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:36:14,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:36:14,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:36:14,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:36:14,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:36:14,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:36:14,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:36:14,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:36:14,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:36:14,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:36:14,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:36:14,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:36:14,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:36:14,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:36:14,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:36:14,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:36:14,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:36:14,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:36:14,092 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 08:36:14,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:36:14,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:36:14,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:36:14,104 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:36:14,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:36:14,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:36:14,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:36:14,105 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:36:14,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:36:14,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:36:14,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:36:14,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:36:14,106 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:36:14,106 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:36:14,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:36:14,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:36:14,107 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:36:14,107 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_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2018-11-23 08:36:14,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:36:14,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:36:14,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:36:14,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:36:14,147 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:36:14,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-11-23 08:36:14,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/c11d25a6b/b04c5b89cba74291b3ffb3f6939a3992/FLAG25a128f97 [2018-11-23 08:36:14,572 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:36:14,572 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/sv-benchmarks/c/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-11-23 08:36:14,576 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/c11d25a6b/b04c5b89cba74291b3ffb3f6939a3992/FLAG25a128f97 [2018-11-23 08:36:14,586 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/data/c11d25a6b/b04c5b89cba74291b3ffb3f6939a3992 [2018-11-23 08:36:14,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:36:14,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:36:14,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:14,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:36:14,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:36:14,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14, skipping insertion in model container [2018-11-23 08:36:14,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:36:14,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:36:14,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:14,753 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:36:14,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:14,798 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:36:14,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14 WrapperNode [2018-11-23 08:36:14,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:14,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:14,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:36:14,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:36:14,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:14,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:36:14,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:36:14,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:36:14,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... [2018-11-23 08:36:14,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:36:14,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:36:14,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:36:14,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:36:14,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/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 08:36:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 08:36:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 08:36:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:36:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 08:36:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:36:14,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:36:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 08:36:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:36:15,038 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:36:15,075 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:36:15,203 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:36:15,204 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 08:36:15,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:15 BoogieIcfgContainer [2018-11-23 08:36:15,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:36:15,204 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:36:15,205 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:36:15,211 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:36:15,211 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:15" (1/1) ... [2018-11-23 08:36:15,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 25 states and 40 transitions. [2018-11-23 08:36:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2018-11-23 08:36:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:36:15,241 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:15,273 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:15,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:15,305 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 08:36:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 25 states and 37 transitions. [2018-11-23 08:36:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2018-11-23 08:36:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 08:36:15,312 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:15,313 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:15,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:15,401 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 08:36:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2018-11-23 08:36:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2018-11-23 08:36:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:36:16,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:16,106 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:16,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:16,134 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 08:36:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 28 states and 40 transitions. [2018-11-23 08:36:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-11-23 08:36:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:36:16,146 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:16,147 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:16,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:16,160 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 08:36:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2018-11-23 08:36:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-11-23 08:36:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:36:16,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:16,166 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:16,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:16,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,215 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,219 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 08:36:16,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 08:36:16,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,268 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 08:36:16,282 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 08:36:16,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,290 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 08:36:16,295 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 08:36:16,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:36:16,355 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 08:36:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 24 states and 29 transitions. [2018-11-23 08:36:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-23 08:36:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:36:16,803 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:16,804 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:16,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:16,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,826 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 08:36:16,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:16,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 08:36:16,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,864 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 08:36:16,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 08:36:16,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:16,874 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 08:36:16,882 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 08:36:16,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:36:16,942 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 08:36:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 22 states and 24 transitions. [2018-11-23 08:36:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 08:36:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:36:16,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:16,960 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:16,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:17,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-23 08:36:17,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 08:36:17,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 08:36:17,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:17,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:17,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:17,032 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 08:36:17,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 08:36:17,135 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 08:36:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 08:36:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 08:36:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 08:36:18,174 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:36:18,175 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:36:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:18,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:18,203 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,203 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,204 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 08:36:18,233 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,234 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 08:36:18,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,244 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 08:36:18,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 08:36:18,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,250 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 08:36:18,254 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 08:36:18,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:36:18,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 08:36:18,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 08:36:18,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 08:36:18,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,362 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 08:36:18,362 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 08:36:18,487 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,488 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,489 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 08:36:18,529 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-23 08:36:18,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,540 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 17 treesize of output 13 [2018-11-23 08:36:18,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:36:18,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 08:36:18,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:18,547 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 08:36:18,551 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 08:36:18,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2018-11-23 08:36:18,633 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 08:36:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:36:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 17 states and 16 transitions. [2018-11-23 08:36:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2018-11-23 08:36:20,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:36:20,181 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 9 iterations. [2018-11-23 08:36:20,187 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 08:36:20,234 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 08:36:20,236 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 08:36:20,238 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,240 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,240 INFO L579 CodeCheckObserver]: Invariant with dag size 14 [2018-11-23 08:36:20,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,242 INFO L579 CodeCheckObserver]: Invariant with dag size 14 [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,244 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 08:36:20,244 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 08:36:20,244 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,245 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:36:20 ImpRootNode [2018-11-23 08:36:20,245 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 08:36:20,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:36:20,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:36:20,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:36:20,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:15" (3/4) ... [2018-11-23 08:36:20,248 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:36:20,254 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 08:36:20,254 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 08:36:20,254 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 08:36:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_prenex_7 : bv64 :: signbit == ~bvand32(2147483648bv32, v_prenex_7[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0])) [2018-11-23 08:36:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-11-23 08:36:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_q#valueAsBitvector_3 : bv64 :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~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] == msw) [2018-11-23 08:36:20,290 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_799700fe-6b92-49b4-ac19-53a6aa6f6438/bin-2019/ukojak/witness.graphml [2018-11-23 08:36:20,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:36:20,291 INFO L168 Benchmark]: Toolchain (without parser) took 5701.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 70.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:20,291 INFO L168 Benchmark]: CDTParser took 0.12 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 08:36:20,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:20,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:36:20,292 INFO L168 Benchmark]: Boogie Preprocessor took 63.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:20,292 INFO L168 Benchmark]: RCFGBuilder took 311.34 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.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:20,293 INFO L168 Benchmark]: CodeCheck took 5040.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:20,293 INFO L168 Benchmark]: Witness Printer took 44.69 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 08:36:20,295 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, 28 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4188 SDtfs, 1502 SDslu, 1652 SDs, 0 SdLazy, 2812 SolverSat, 1006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 817 GetRequests, 752 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 93 ConstructedInterpolants, 20 QuantifiedInterpolants, 5823 SizeOfPredicates, 37 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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: 86]: 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: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2018-11-23 08:36:20,295 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (\exists v_prenex_7 : bv64 :: signbit == ~bvand32(2147483648bv32, v_prenex_7[63:32]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0])) - InvariantResult [Line: 65]: Loop Invariant [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 08:36:20,297 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 :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~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] == msw) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 65]: Loop Invariant [2018-11-23 08:36:20,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:36:20,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~fp.add~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.34 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.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * CodeCheck took 5040.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. * Witness Printer took 44.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - 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 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - 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 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...