./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_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_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f ................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_8)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:03:30,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:03:30,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:03:30,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:03:30,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:03:30,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:03:30,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:03:30,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:03:30,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:03:30,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:03:30,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:03:30,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:03:30,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:03:30,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:03:30,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:03:30,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:03:30,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:03:30,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:03:30,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:03:30,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:03:30,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:03:30,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:03:30,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:03:30,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:03:30,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:03:30,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:03:30,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:03:30,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:03:30,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:03:30,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:03:30,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:03:30,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:03:30,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:03:30,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:03:30,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:03:30,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:03:30,181 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 06:03:30,190 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:03:30,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:03:30,191 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:03:30,191 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:03:30,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:03:30,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:03:30,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:03:30,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:03:30,193 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:03:30,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:03:30,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:03:30,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:03:30,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:03:30,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:03:30,194 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 06:03:30,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:03:30,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:03:30,194 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_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2018-11-23 06:03:30,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:03:30,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:03:30,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:03:30,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:03:30,230 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:03:30,230 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 06:03:30,272 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/2bfaa66d2/f85b8395095344719be6044406558a8e/FLAG5e8c20067 [2018-11-23 06:03:30,614 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:03:30,614 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 06:03:30,618 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/2bfaa66d2/f85b8395095344719be6044406558a8e/FLAG5e8c20067 [2018-11-23 06:03:31,035 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/2bfaa66d2/f85b8395095344719be6044406558a8e [2018-11-23 06:03:31,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:03:31,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:03:31,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:31,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:03:31,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:03:31,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37302a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31, skipping insertion in model container [2018-11-23 06:03:31,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:03:31,067 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:03:31,187 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:31,189 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:03:31,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:31,219 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:03:31,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31 WrapperNode [2018-11-23 06:03:31,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:31,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:31,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:03:31,220 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:03:31,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:31,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:03:31,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:03:31,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:03:31,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:03:31,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:03:31,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:03:31,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:03:31,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 06:03:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 06:03:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:03:31,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:03:31,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:03:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:03:31,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:03:31,532 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:03:31,532 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 06:03:31,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:03:31 BoogieIcfgContainer [2018-11-23 06:03:31,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:03:31,533 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:03:31,533 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:03:31,539 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:03:31,539 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:03:31" (1/1) ... [2018-11-23 06:03:31,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:03:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:03:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-11-23 06:03:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-11-23 06:03:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:03:31,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:03:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:03:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:03:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:03:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 06:03:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 06:03:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 06:03:31,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:03:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:03:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:03:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:03:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:03:31,828 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~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; VAL [ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0] [?] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);call isinf_double_#t~mem0 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~mem0;havoc isinf_double_#t~union1;call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~mem2;havoc isinf_double_#t~union3;call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset);havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [ULTIMATE.start_isinf_double_~hx~0=0, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_isinf_double_~hx~0=0, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0] [?] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296);main_#t~ret7 := isinf_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647;main_#t~short9 := 0 == main_#t~ret7;BeginParallelComposition{ParallelCodeBlock0: assume !main_#t~short9;ParallelCodeBlock1: assume main_#t~short9;isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0);main_#t~ret8 := isnan_double_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_#t~short9 := 0 == main_#t~ret8;}EndParallelComposition VAL [ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_main_#t~ret7|=0, |ULTIMATE.start_main_#t~ret8|=0, |ULTIMATE.start_main_#t~short9|=true] [?] assume main_#t~short9;havoc main_#t~short9;havoc main_#t~ret7;havoc main_#t~ret8;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; VAL [ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.alloc(8);call write~real(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8);call isfinite_double_#t~mem4 := read~int(isfinite_double_~#gh_u~0.base, 4 + isfinite_double_~#gh_u~0.offset, 4);isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8);havoc isfinite_double_#t~mem4;havoc isfinite_double_#t~union5;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset);havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; VAL [ULTIMATE.start_isfinite_double_~hx~1=2616, ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] goto; VAL [ULTIMATE.start_isfinite_double_~hx~1=2616, ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296);main_#t~ret10 := isfinite_double_#res;assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647;main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10);havoc main_#t~ret10; VAL [ULTIMATE.start_isfinite_double_~hx~1=2616, ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isfinite_double_#res|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_isfinite_double_~hx~1=2616, ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isfinite_double_#res|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] assume !false; VAL [ULTIMATE.start_isfinite_double_~hx~1=2616, ULTIMATE.start_isfinite_double_~x=0.0, ULTIMATE.start_isinf_double_~hx~0=2146435072, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=0.0, ULTIMATE.start_isnan_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isfinite_double_#in~x|=0.0, |ULTIMATE.start_isfinite_double_#res|=0, |ULTIMATE.start_isinf_double_#in~x|=0.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_isnan_double_#in~x|=0.0, |ULTIMATE.start_isnan_double_#res|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0; [L50] main_~x~0 := main_#t~nondet6; [L50] havoc main_#t~nondet6; [L53] isinf_double_#in~x := main_~x~0; [L53] havoc isinf_double_#res; [L53] havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L16-L28] isinf_double_~x := isinf_double_#in~x; [L17] havoc isinf_double_~hx~0; [L17] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_~x=0.0, main_~x~0=0.0] [L19] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L20] call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L21] call isinf_double_#t~mem0 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4); [L21] isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] call write~real(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L21] havoc isinf_double_#t~mem0; [L21] havoc isinf_double_#t~union1; [L22] call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4); [L22] isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L22] havoc isinf_double_#t~mem2; [L22] havoc isinf_double_#t~union3; [L19] call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset); [L19] havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_~hx~0=0, isinf_double_~lx~0=3609, isinf_double_~x=0.0, main_~x~0=0.0] [L24] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L25] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L27] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] main_#t~ret7 := isinf_double_#res; [L53] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret7; [L53] assume main_#t~short9; [L53] isnan_double_#in~x := main_~x~0; [L53] havoc isnan_double_#res; [L53] havoc isnan_double_~x; [L31] isnan_double_~x := isnan_double_#in~x; [L31] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L53] main_#t~ret8 := isnan_double_#res; [L53] assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_#t~ret7=0, main_#t~ret8=0, main_#t~short9=true, main_~x~0=0.0] [L53-L62] assume main_#t~short9; [L53] havoc main_#t~short9; [L53] havoc main_#t~ret7; [L53] havoc main_#t~ret8; [L55] isfinite_double_#in~x := main_~x~0; [L55] havoc isfinite_double_#res; [L55] havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1; [L33-L41] isfinite_double_~x := isfinite_double_#in~x; [L34] havoc isfinite_double_~hx~1; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L36] call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.alloc(8); [L37] call write~real(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8); [L38] call isfinite_double_#t~mem4 := read~int(isfinite_double_~#gh_u~0.base, 4 + isfinite_double_~#gh_u~0.offset, 4); [L38] isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] call write~real(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8); [L38] havoc isfinite_double_#t~mem4; [L38] havoc isfinite_double_#t~union5; [L36] call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset); [L36] havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L40] isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] main_#t~ret10 := isfinite_double_#res; [L55] assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647; [L55] main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10); [L55] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L58-L61] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=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~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0; [L50] main_~x~0 := main_#t~nondet6; [L50] havoc main_#t~nondet6; [L53] isinf_double_#in~x := main_~x~0; [L53] havoc isinf_double_#res; [L53] havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L16-L28] isinf_double_~x := isinf_double_#in~x; [L17] havoc isinf_double_~hx~0; [L17] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_~x=0.0, main_~x~0=0.0] [L19] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L20] call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L21] call isinf_double_#t~mem0 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4); [L21] isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] call write~real(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L21] havoc isinf_double_#t~mem0; [L21] havoc isinf_double_#t~union1; [L22] call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4); [L22] isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L22] havoc isinf_double_#t~mem2; [L22] havoc isinf_double_#t~union3; [L19] call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset); [L19] havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_~hx~0=0, isinf_double_~lx~0=3609, isinf_double_~x=0.0, main_~x~0=0.0] [L24] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L25] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L27] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] main_#t~ret7 := isinf_double_#res; [L53] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret7; [L53] assume main_#t~short9; [L53] isnan_double_#in~x := main_~x~0; [L53] havoc isnan_double_#res; [L53] havoc isnan_double_~x; [L31] isnan_double_~x := isnan_double_#in~x; [L31] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L53] main_#t~ret8 := isnan_double_#res; [L53] assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_#t~ret7=0, main_#t~ret8=0, main_#t~short9=true, main_~x~0=0.0] [L53-L62] assume main_#t~short9; [L53] havoc main_#t~short9; [L53] havoc main_#t~ret7; [L53] havoc main_#t~ret8; [L55] isfinite_double_#in~x := main_~x~0; [L55] havoc isfinite_double_#res; [L55] havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1; [L33-L41] isfinite_double_~x := isfinite_double_#in~x; [L34] havoc isfinite_double_~hx~1; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L36] call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.alloc(8); [L37] call write~real(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8); [L38] call isfinite_double_#t~mem4 := read~int(isfinite_double_~#gh_u~0.base, 4 + isfinite_double_~#gh_u~0.offset, 4); [L38] isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] call write~real(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8); [L38] havoc isfinite_double_#t~mem4; [L38] havoc isfinite_double_#t~union5; [L36] call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset); [L36] havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L40] isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] main_#t~ret10 := isfinite_double_#res; [L55] assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647; [L55] main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10); [L55] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L58-L61] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0; [L50] main_~x~0 := main_#t~nondet6; [L50] havoc main_#t~nondet6; [L53] isinf_double_#in~x := main_~x~0; [L53] havoc isinf_double_#res; [L53] havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L16-L28] isinf_double_~x := isinf_double_#in~x; [L17] havoc isinf_double_~hx~0; [L17] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_~x=0.0, main_~x~0=0.0] [L19] FCALL call isinf_double_~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L21] FCALL call isinf_double_#t~mem0 := read~int({ base: isinf_double_~#ew_u~0!base, offset: 4 + isinf_double_~#ew_u~0!offset }, 4); [L21] isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(isinf_double_#t~union1, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L21] havoc isinf_double_#t~mem0; [L21] havoc isinf_double_#t~union1; [L22] FCALL call isinf_double_#t~mem2 := read~int({ base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 4); [L22] isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(isinf_double_#t~union3, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L22] havoc isinf_double_#t~mem2; [L22] havoc isinf_double_#t~union3; [L19] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~0); [L19] havoc isinf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_~hx~0=0, isinf_double_~lx~0=3609, isinf_double_~x=0.0, main_~x~0=0.0] [L24] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L25] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L27] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] main_#t~ret7 := isinf_double_#res; [L53] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret7; [L53] COND TRUE main_#t~short9 [L53] isnan_double_#in~x := main_~x~0; [L53] havoc isnan_double_#res; [L53] havoc isnan_double_~x; [L31] isnan_double_~x := isnan_double_#in~x; [L31] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L53] main_#t~ret8 := isnan_double_#res; [L53] assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_#t~ret7=0, main_#t~ret8=0, main_#t~short9=true, main_~x~0=0.0] [L53] COND TRUE main_#t~short9 [L53] havoc main_#t~short9; [L53] havoc main_#t~ret7; [L53] havoc main_#t~ret8; [L55] isfinite_double_#in~x := main_~x~0; [L55] havoc isfinite_double_#res; [L55] havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0, isfinite_double_~x, isfinite_double_~hx~1; [L33-L41] isfinite_double_~x := isfinite_double_#in~x; [L34] havoc isfinite_double_~hx~1; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L36] FCALL call isfinite_double_~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(isfinite_double_~x, { base: isfinite_double_~#gh_u~0!base, offset: isfinite_double_~#gh_u~0!offset }, 8); [L38] FCALL call isfinite_double_#t~mem4 := read~int({ base: isfinite_double_~#gh_u~0!base, offset: 4 + isfinite_double_~#gh_u~0!offset }, 4); [L38] isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(isfinite_double_#t~union5, { base: isfinite_double_~#gh_u~0!base, offset: isfinite_double_~#gh_u~0!offset }, 8); [L38] havoc isfinite_double_#t~mem4; [L38] havoc isfinite_double_#t~union5; [L36] FCALL call ULTIMATE.dealloc(isfinite_double_~#gh_u~0); [L36] havoc isfinite_double_~#gh_u~0; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L40] isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] main_#t~ret10 := isfinite_double_#res; [L55] assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647; [L55] main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10); [L55] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=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~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0; [L50] main_~x~0 := main_#t~nondet6; [L50] havoc main_#t~nondet6; [L53] isinf_double_#in~x := main_~x~0; [L53] havoc isinf_double_#res; [L53] havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L16-L28] isinf_double_~x := isinf_double_#in~x; [L17] havoc isinf_double_~hx~0; [L17] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_~x=0.0, main_~x~0=0.0] [L19] FCALL call isinf_double_~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L21] FCALL call isinf_double_#t~mem0 := read~int({ base: isinf_double_~#ew_u~0!base, offset: 4 + isinf_double_~#ew_u~0!offset }, 4); [L21] isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(isinf_double_#t~union1, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L21] havoc isinf_double_#t~mem0; [L21] havoc isinf_double_#t~union1; [L22] FCALL call isinf_double_#t~mem2 := read~int({ base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 4); [L22] isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(isinf_double_#t~union3, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L22] havoc isinf_double_#t~mem2; [L22] havoc isinf_double_#t~union3; [L19] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~0); [L19] havoc isinf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_~hx~0=0, isinf_double_~lx~0=3609, isinf_double_~x=0.0, main_~x~0=0.0] [L24] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L25] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L27] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] main_#t~ret7 := isinf_double_#res; [L53] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret7; [L53] COND TRUE main_#t~short9 [L53] isnan_double_#in~x := main_~x~0; [L53] havoc isnan_double_#res; [L53] havoc isnan_double_~x; [L31] isnan_double_~x := isnan_double_#in~x; [L31] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L53] main_#t~ret8 := isnan_double_#res; [L53] assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; [L53] main_#t~short9 := 0 == main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_#t~ret7=0, main_#t~ret8=0, main_#t~short9=true, main_~x~0=0.0] [L53] COND TRUE main_#t~short9 [L53] havoc main_#t~short9; [L53] havoc main_#t~ret7; [L53] havoc main_#t~ret8; [L55] isfinite_double_#in~x := main_~x~0; [L55] havoc isfinite_double_#res; [L55] havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0, isfinite_double_~x, isfinite_double_~hx~1; [L33-L41] isfinite_double_~x := isfinite_double_#in~x; [L34] havoc isfinite_double_~hx~1; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L36] FCALL call isfinite_double_~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(isfinite_double_~x, { base: isfinite_double_~#gh_u~0!base, offset: isfinite_double_~#gh_u~0!offset }, 8); [L38] FCALL call isfinite_double_#t~mem4 := read~int({ base: isfinite_double_~#gh_u~0!base, offset: 4 + isfinite_double_~#gh_u~0!offset }, 4); [L38] isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(isfinite_double_#t~union5, { base: isfinite_double_~#gh_u~0!base, offset: isfinite_double_~#gh_u~0!offset }, 8); [L38] havoc isfinite_double_#t~mem4; [L38] havoc isfinite_double_#t~union5; [L36] FCALL call ULTIMATE.dealloc(isfinite_double_~#gh_u~0); [L36] havoc isfinite_double_~#gh_u~0; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L40] isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] main_#t~ret10 := isfinite_double_#res; [L55] assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647; [L55] main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10); [L55] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, isfinite_double_#in~x=0.0, isfinite_double_#res=0, isfinite_double_~hx~1=2616, isfinite_double_~x=0.0, isinf_double_#in~x=0.0, isinf_double_#res=0, isinf_double_~hx~0=2146435072, isinf_double_~lx~0=3609, isinf_double_~x=0.0, isnan_double_#in~x=0.0, isnan_double_#res=0, isnan_double_~x=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; [L53] COND TRUE #t~short9 [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0] [L53] COND TRUE #t~short9 [L53] havoc #t~short9; [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#NULL!base=0, #NULL!offset=0] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0] [L59] 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; [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; [L53] COND TRUE #t~short9 [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0] [L53] COND TRUE #t~short9 [L53] havoc #t~short9; [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#NULL!base=0, #NULL!offset=0] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L50] double x = __VERIFIER_nondet_double(); [L17] __int32_t hx, lx; [L19] ieee_double_shape_type ew_u; [L20] ew_u.value = (x) [L21] EXPR ew_u.parts.msw [L21] (hx) = ew_u.parts.msw [L22] EXPR ew_u.parts.lsw [L22] (lx) = ew_u.parts.lsw [L24] hx &= 0x7fffffff [L25] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L26] hx = 0x7ff00000 - hx [L27] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L53] !isinf_double(x) && !isnan_double(x) [L31] return x != x; [L53] !isinf_double(x) && !isnan_double(x) [L53] COND TRUE !isinf_double(x) && !isnan_double(x) [L34] __int32_t hx; [L36] ieee_double_shape_type gh_u; [L37] gh_u.value = (x) [L38] EXPR gh_u.parts.msw [L38] (hx) = gh_u.parts.msw [L40] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); [L55] double res = isfinite_double(x); [L58] COND TRUE res == 0.0 [L59] __VERIFIER_error() ----- [2018-11-23 06:03:31,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 06:03:31 ImpRootNode [2018-11-23 06:03:31,866 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 06:03:31,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:03:31,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:03:31,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:03:31,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:03:31" (3/4) ... [2018-11-23 06:03:31,871 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:03:31,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:03:31,871 INFO L168 Benchmark]: Toolchain (without parser) took 834.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -96.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:31,873 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:31,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:31,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:31,875 INFO L168 Benchmark]: Boogie Preprocessor took 52.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:31,875 INFO L168 Benchmark]: RCFGBuilder took 231.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:31,876 INFO L168 Benchmark]: CodeCheck took 333.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:31,877 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:31,880 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, 20 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 51 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, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 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: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 25, overapproximation of bitwiseAnd at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of to_real at line 55. Possible FailurePath: [L50] double x = __VERIFIER_nondet_double(); [L17] __int32_t hx, lx; [L19] ieee_double_shape_type ew_u; [L20] ew_u.value = (x) [L21] EXPR ew_u.parts.msw [L21] (hx) = ew_u.parts.msw [L22] EXPR ew_u.parts.lsw [L22] (lx) = ew_u.parts.lsw [L24] hx &= 0x7fffffff [L25] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L26] hx = 0x7ff00000 - hx [L27] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L53] !isinf_double(x) && !isnan_double(x) [L31] return x != x; [L53] !isinf_double(x) && !isnan_double(x) [L53] COND TRUE !isinf_double(x) && !isnan_double(x) [L34] __int32_t hx; [L36] ieee_double_shape_type gh_u; [L37] gh_u.value = (x) [L38] EXPR gh_u.parts.msw [L38] (hx) = gh_u.parts.msw [L40] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); [L55] double res = isfinite_double(x); [L58] COND TRUE res == 0.0 [L59] __VERIFIER_error() * 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * CodeCheck took 333.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 06:03:33,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:03:33,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:03:33,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:03:33,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:03:33,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:03:33,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:03:33,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:03:33,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:03:33,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:03:33,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:03:33,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:03:33,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:03:33,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:03:33,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:03:33,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:03:33,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:03:33,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:03:33,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:03:33,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:03:33,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:03:33,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:03:33,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:03:33,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:03:33,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:03:33,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:03:33,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:03:33,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:03:33,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:03:33,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:03:33,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:03:33,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:03:33,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:03:33,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:03:33,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:03:33,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:03:33,355 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 06:03:33,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:03:33,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:03:33,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:03:33,367 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:03:33,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:03:33,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:03:33,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:03:33,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:03:33,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:03:33,369 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:03:33,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:03:33,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:03:33,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:03:33,370 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:03:33,371 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_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2018-11-23 06:03:33,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:03:33,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:03:33,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:03:33,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:03:33,413 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:03:33,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 06:03:33,457 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/1469a17ea/877f7646a0d64c86aa5314bb51dd124e/FLAGb7f7c4723 [2018-11-23 06:03:33,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:03:33,775 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 06:03:33,779 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/1469a17ea/877f7646a0d64c86aa5314bb51dd124e/FLAGb7f7c4723 [2018-11-23 06:03:33,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/bin-2019/ukojak/data/1469a17ea/877f7646a0d64c86aa5314bb51dd124e [2018-11-23 06:03:33,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:03:33,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:03:33,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:33,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:03:33,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:03:33,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:33,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b4c4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33, skipping insertion in model container [2018-11-23 06:03:33,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:33,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:03:33,823 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:03:33,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:33,951 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:03:33,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:33,987 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:03:33,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33 WrapperNode [2018-11-23 06:03:33,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:33,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:33,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:03:33,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:03:33,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:33,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:34,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:03:34,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:03:34,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:03:34,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... [2018-11-23 06:03:34,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:03:34,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:03:34,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:03:34,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:03:34,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f42c03e4-3157-4f17-bd94-c2504ce05a17/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 06:03:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 06:03:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:03:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 06:03:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:03:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:03:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:03:34,233 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:03:34,272 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:03:34,470 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:03:34,470 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 06:03:34,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:03:34 BoogieIcfgContainer [2018-11-23 06:03:34,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:03:34,471 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:03:34,471 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:03:34,482 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:03:34,482 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:03:34" (1/1) ... [2018-11-23 06:03:34,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:03:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:03:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-11-23 06:03:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-11-23 06:03:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:03:34,514 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:03:34,548 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:03:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:03:34,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:03:34,596 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 06:03:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:03:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 06:03:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 06:03:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 06:03:34,603 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:03:34,604 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:03:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:03:34,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:03:34,793 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:03:34,794 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:03:34,795 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:03:34,795 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:03:34,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-11-23 06:03:34,804 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_8)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createTraceCheck(CodeCheckObserver.java:624) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:454) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 06:03:34,807 INFO L168 Benchmark]: Toolchain (without parser) took 1015.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:34,808 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:34,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.04 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:34,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.44 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:34,809 INFO L168 Benchmark]: Boogie Preprocessor took 18.69 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:03:34,810 INFO L168 Benchmark]: RCFGBuilder took 440.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:34,810 INFO L168 Benchmark]: CodeCheck took 334.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:03:34,813 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_8)) de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_8)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.04 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 934.4 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 23.44 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.69 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 440.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * CodeCheck took 334.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...