./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1092d_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_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbea5fc7c8725f5cbc8325b1d09f091d3964966d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbea5fc7c8725f5cbc8325b1d09f091d3964966d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:38:19,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:19,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:19,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:19,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:19,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:19,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:19,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:19,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:19,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:19,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:19,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:19,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:19,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:19,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:19,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:19,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:19,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:19,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:19,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:19,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:19,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:19,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:19,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:19,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:19,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:19,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:19,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:19,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:19,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:19,399 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:19,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:19,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:19,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:19,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:19,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:19,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:38:19,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:19,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:19,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:19,412 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:19,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:19,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:19,413 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:19,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:19,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:19,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:19,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:19,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:19,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:19,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:38:19,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:19,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:38:19,416 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_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbea5fc7c8725f5cbc8325b1d09f091d3964966d [2018-11-23 11:38:19,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:19,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:19,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:19,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:19,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:19,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:19,486 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/2915eb0ee/70eef62e01eb4a8db715861876ca7096/FLAG4ac26ff45 [2018-11-23 11:38:19,891 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:19,892 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:19,897 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/2915eb0ee/70eef62e01eb4a8db715861876ca7096/FLAG4ac26ff45 [2018-11-23 11:38:19,906 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/2915eb0ee/70eef62e01eb4a8db715861876ca7096 [2018-11-23 11:38:19,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:19,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:19,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:19,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:19,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:19,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:19" (1/1) ... [2018-11-23 11:38:19,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3709085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:19, skipping insertion in model container [2018-11-23 11:38:19,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:19" (1/1) ... [2018-11-23 11:38:19,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:19,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:20,054 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:20,056 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:20,078 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:20,090 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:20,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20 WrapperNode [2018-11-23 11:38:20,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:20,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:20,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:20,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:20,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:20,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:20,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:20,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:20,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... [2018-11-23 11:38:20,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:20,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:20,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:20,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:20,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 11:38:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 11:38:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 11:38:20,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 11:38:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:20,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:38:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:20,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:38:20,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:20,447 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:38:20,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:20 BoogieIcfgContainer [2018-11-23 11:38:20,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:20,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:20,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:20,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:20,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:19" (1/3) ... [2018-11-23 11:38:20,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbd544c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:20, skipping insertion in model container [2018-11-23 11:38:20,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:20" (2/3) ... [2018-11-23 11:38:20,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbd544c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:20, skipping insertion in model container [2018-11-23 11:38:20,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:20" (3/3) ... [2018-11-23 11:38:20,454 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:20,464 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:20,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:20,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:20,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:20,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:20,510 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:20,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:20,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:20,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:20,510 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:20,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:20,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:38:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:38:20,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:20,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:20,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:20,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash -661893902, now seen corresponding path program 1 times [2018-11-23 11:38:20,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:38:20,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:38:20,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:38:20,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:20,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:38:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:20,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:20,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:38:20,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:38:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:38:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:20,666 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:38:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:20,684 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2018-11-23 11:38:20,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:38:20,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 11:38:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:20,692 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:38:20,692 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:38:20,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:38:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:38:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:38:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-11-23 11:38:20,718 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 25 [2018-11-23 11:38:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:20,718 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 11:38:20,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:38:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-11-23 11:38:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:20,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:20,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:20,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:20,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1235447049, now seen corresponding path program 1 times [2018-11-23 11:38:20,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:38:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:38:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:38:20,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:38:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:38:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:38:20,833 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450955, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=6442450952.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_ceil~0 := 1.0E300; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #142#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret10 := ceil_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0;havoc ~j~0; VAL [ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~j0~0 < 20; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(~j0~0 < 0);~i~0 := ~shiftRight(1048575, ~j0~0); VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296;#res := ~x; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, |ceil_double_#res|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, |ceil_double_#res|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #146#return; VAL [main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret11 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union7;havoc #t~mem6;call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem8;havoc #t~union9;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~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);~hx~0 := 2146435072 - ~hx~0;#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); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, |isinf_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, |isinf_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #148#return; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450955, #NULL.offset=6442450946, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26-L70] assume ~j0~0 < 20; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27-L47] assume !(~j0~0 < 0); [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39-L40] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L16-L78] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L85] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L84] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L81-L93] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107-L110] assume 0 == #t~ret11; [L107] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450955, #NULL.offset=6442450946, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26-L70] assume ~j0~0 < 20; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27-L47] assume !(~j0~0 < 0); [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39-L40] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L16-L78] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L85] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L84] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L81-L93] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107-L110] assume 0 == #t~ret11; [L107] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] COND TRUE 0 == #t~ret11 [L107] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] COND TRUE 0 == #t~ret11 [L107] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] COND TRUE 0 == #t~ret11 [L107] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~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); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #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); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L107] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] COND TRUE 0 == #t~ret11 [L107] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L108] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L14] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=6442450952, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L103] double x = -1.0 / 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L104] CALL, EXPR ceil_double(x) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, x=6442450954] [L26] COND TRUE j0 < 20 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L27] COND FALSE !(j0 < 0) [L38] i = (0x000fffff) >> j0 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L39] COND TRUE ((i0 & i) | i1) == 0 [L40] return x; VAL [\old(x)=6442450954, \result=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L104] RET, EXPR ceil_double(x) VAL [ceil_double(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L104] double res = ceil_double(x); [L107] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L82] __int32_t hx, lx; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L84] ieee_double_shape_type ew_u; [L85] ew_u.value = (x) [L86] EXPR ew_u.parts.msw [L86] (hx) = ew_u.parts.msw [L87] EXPR ew_u.parts.lsw [L87] (lx) = ew_u.parts.lsw [L89] hx &= 0x7fffffff [L90] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L91] hx = 0x7ff00000 - hx [L92] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450954, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=6442450954] [L107] RET, EXPR isinf_double(res) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=6442450954, x=6442450954] [L107] COND TRUE !isinf_double(res) [L108] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450954, x=6442450954] ----- [2018-11-23 11:38:20,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:38:20 BoogieIcfgContainer [2018-11-23 11:38:20,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:38:20,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:38:20,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:38:20,895 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:38:20,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:20" (3/4) ... [2018-11-23 11:38:20,898 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:38:20,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:38:20,899 INFO L168 Benchmark]: Toolchain (without parser) took 990.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,900 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:38:20,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.05 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,902 INFO L168 Benchmark]: Boogie Preprocessor took 63.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,902 INFO L168 Benchmark]: RCFGBuilder took 269.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,903 INFO L168 Benchmark]: TraceAbstraction took 444.64 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:38:20,903 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:38:20,906 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 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 23.05 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 444.64 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 108]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 38, overapproximation of bitwiseOr at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 103, overapproximation of bitwiseAnd at line 89. Possible FailurePath: [L14] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=6442450952, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L103] double x = -1.0 / 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L104] CALL, EXPR ceil_double(x) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, x=6442450954] [L26] COND TRUE j0 < 20 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L27] COND FALSE !(j0 < 0) [L38] i = (0x000fffff) >> j0 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L39] COND TRUE ((i0 & i) | i1) == 0 [L40] return x; VAL [\old(x)=6442450954, \result=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L104] RET, EXPR ceil_double(x) VAL [ceil_double(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L104] double res = ceil_double(x); [L107] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L82] __int32_t hx, lx; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L84] ieee_double_shape_type ew_u; [L85] ew_u.value = (x) [L86] EXPR ew_u.parts.msw [L86] (hx) = ew_u.parts.msw [L87] EXPR ew_u.parts.lsw [L87] (lx) = ew_u.parts.lsw [L89] hx &= 0x7fffffff [L90] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L91] hx = 0x7ff00000 - hx [L92] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450954, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=6442450954] [L107] RET, EXPR isinf_double(res) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=6442450954, x=6442450954] [L107] COND TRUE !isinf_double(res) [L108] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450954, x=6442450954] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 11:38:22,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:22,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:22,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:22,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:22,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:22,368 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:22,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:22,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:22,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:22,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:22,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:22,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:22,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:22,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:22,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:22,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:22,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:22,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:22,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:22,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:22,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:22,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:22,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:22,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:22,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:22,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:22,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:22,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:22,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:22,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:22,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:22,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:22,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:22,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:22,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:22,388 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:38:22,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:22,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:22,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:22,399 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:22,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:22,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:22,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:22,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:22,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:22,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:22,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:22,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:22,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:22,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:22,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:22,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:22,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:22,403 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:22,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:22,403 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:22,403 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:22,403 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_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbea5fc7c8725f5cbc8325b1d09f091d3964966d [2018-11-23 11:38:22,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:22,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:22,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:22,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:22,449 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:22,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:22,494 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/ef684a2da/0738e78e2c9d4828b5df22bb992cf577/FLAG78cac8904 [2018-11-23 11:38:22,824 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:22,824 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/sv-benchmarks/c/float-newlib/double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:22,828 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/ef684a2da/0738e78e2c9d4828b5df22bb992cf577/FLAG78cac8904 [2018-11-23 11:38:23,251 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/data/ef684a2da/0738e78e2c9d4828b5df22bb992cf577 [2018-11-23 11:38:23,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:23,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:23,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:23,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:23,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:23,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d872129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23, skipping insertion in model container [2018-11-23 11:38:23,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:23,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:23,420 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:23,424 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:23,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:23,474 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:23,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23 WrapperNode [2018-11-23 11:38:23,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:23,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:23,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:23,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:23,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:23,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:23,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:23,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:23,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... [2018-11-23 11:38:23,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:23,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:23,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:23,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:23,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 11:38:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 11:38:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 11:38:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 11:38:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:38:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:38:23,711 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:38:23,997 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 11:38:24,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:24,650 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:38:24,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:24 BoogieIcfgContainer [2018-11-23 11:38:24,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:24,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:24,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:24,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:24,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:23" (1/3) ... [2018-11-23 11:38:24,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250bab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:24, skipping insertion in model container [2018-11-23 11:38:24,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:23" (2/3) ... [2018-11-23 11:38:24,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250bab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:24, skipping insertion in model container [2018-11-23 11:38:24,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:24" (3/3) ... [2018-11-23 11:38:24,655 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092d_true-unreach-call.c [2018-11-23 11:38:24,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:24,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:24,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:24,693 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:24,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:24,693 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:24,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:24,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:24,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:24,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:24,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:24,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 11:38:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:38:24,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:24,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:24,709 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:24,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash -721738728, now seen corresponding path program 1 times [2018-11-23 11:38:24,715 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:38:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 11:38:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:24,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:24,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:38:24,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:38:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:38:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:24,804 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 11:38:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:24,821 INFO L93 Difference]: Finished difference Result 90 states and 133 transitions. [2018-11-23 11:38:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:38:24,822 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:38:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:24,829 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:38:24,829 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:38:24,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:38:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 11:38:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:38:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-11-23 11:38:24,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 24 [2018-11-23 11:38:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-23 11:38:24,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:38:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 11:38:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:24,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:24,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:24,858 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1549059375, now seen corresponding path program 1 times [2018-11-23 11:38:24,859 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:38:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 11:38:24,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:24,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:25,009 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:25,010 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:25,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 11:38:25,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 11:38:25,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:38:25,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 11:38:25,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:25,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:25,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:25,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:38:25,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 11:38:26,861 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:38:28,722 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:38:30,714 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:38:32,574 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:38:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:32,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:32,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:38:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:32,663 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 9 states. [2018-11-23 11:38:34,812 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:38:36,882 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:38:38,975 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:38:43,097 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-23 11:38:48,291 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 11:38:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:56,693 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-11-23 11:38:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:38:56,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:38:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:56,697 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:38:56,697 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:38:56,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:38:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:38:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-23 11:38:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:38:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 11:38:56,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 26 [2018-11-23 11:38:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:56,702 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 11:38:56,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 11:38:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:56,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:56,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:56,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:56,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1162953480, now seen corresponding path program 1 times [2018-11-23 11:38:56,704 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:38:56,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 11:38:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:56,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:56,807 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:56,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:56,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 11:38:56,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 11:38:56,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:56,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:38:56,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 11:38:56,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:56,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:56,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:56,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:38:56,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 11:38:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:56,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:56,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:56,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:38:56,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:38:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:38:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:38:56,955 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2018-11-23 11:38:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:58,451 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:38:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:38:58,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:38:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:58,453 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:38:58,453 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:38:58,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:38:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:38:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:38:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:38:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 11:38:58,456 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2018-11-23 11:38:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:58,456 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 11:38:58,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:38:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:38:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:58,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:58,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:58,457 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:58,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1463112616, now seen corresponding path program 1 times [2018-11-23 11:38:58,457 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:38:58,457 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 11:38:58,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:58,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:59,468 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:59,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:59,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 11:38:59,500 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:38:59,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 11:38:59,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:59,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:38:59,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 11:38:59,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:38:59,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:59,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:38:59,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:38:59,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 11:39:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:00,197 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:39:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:39:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:39:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:39:00,206 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-23 11:39:01,566 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 11:39:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,446 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 11:39:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:39:03,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 11:39:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:03,447 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:39:03,447 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:39:03,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:39:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:39:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:39:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:39:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 11:39:03,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2018-11-23 11:39:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:03,451 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 11:39:03,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:39:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 11:39:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:39:03,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:03,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:03,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:03,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1756515623, now seen corresponding path program 1 times [2018-11-23 11:39:03,452 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 11:39:03,452 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 11:39:03,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:03,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:03,576 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:39:03,576 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:39:03,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 11:39:03,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:39:03,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:39:03,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 11:39:03,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 11:39:03,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:39:03,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:39:03,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:39:03,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:39:03,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 11:39:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:03,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:03,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:39:03,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:39:03,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:39:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:39:03,712 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 7 states. [2018-11-23 11:39:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,941 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 11:39:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:39:03,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:39:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:03,942 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:39:03,942 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:39:03,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:39:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:39:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:39:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:39:03,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-23 11:39:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:03,943 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:39:03,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:39:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:03,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:03,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 88) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L444 ceAbstractionStarter]: At program point L83-2(lines 83 88) the Hoare annotation is: (= isinf_double_~x |isinf_double_#in~x|) [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point L83-3(lines 83 88) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 81 93) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 81 93) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 81 93) the Hoare annotation is: true [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 47) no Hoare annotation was computed. [2018-11-23 11:39:04,002 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 24) the Hoare annotation is: (= |ceil_double_#in~x| ceil_double_~x) [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 70) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 35) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 36) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 69) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 52) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 46) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 35) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 67) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 58 67) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L451 ceAbstractionStarter]: At program point ceil_doubleENTRY(lines 16 78) the Hoare annotation is: true [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 76) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 16 78) no Hoare annotation was computed. [2018-11-23 11:39:04,003 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 71 76) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point ceil_doubleFINAL(lines 16 78) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point ceil_doubleEXIT(lines 16 78) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 64) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 64) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 66) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 70) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:39:04,004 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:39:04,004 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:39:04,004 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 95 113) the Hoare annotation is: true [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 95 113) no Hoare annotation was computed. [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-23 11:39:04,005 INFO L444 ceAbstractionStarter]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse0) main_~res~0) (= .cse0 main_~x~0))) [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 107 110) no Hoare annotation was computed. [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 95 113) no Hoare annotation was computed. [2018-11-23 11:39:04,005 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) [2018-11-23 11:39:04,005 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-23 11:39:04,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:39:04 BoogieIcfgContainer [2018-11-23 11:39:04,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:39:04,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:39:04,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:39:04,014 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:39:04,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:24" (3/4) ... [2018-11-23 11:39:04,017 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:39:04,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:39:04,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 11:39:04,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ceil_double [2018-11-23 11:39:04,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:39:04,025 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 11:39:04,025 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 11:39:04,025 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:39:04,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 11:39:04,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 11:39:04,064 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5b73903-5517-49c8-a180-0c487d04eeb0/bin-2019/uautomizer/witness.graphml [2018-11-23 11:39:04,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:39:04,064 INFO L168 Benchmark]: Toolchain (without parser) took 40809.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 949.7 MB in the beginning and 786.3 MB in the end (delta: 163.4 MB). Peak memory consumption was 276.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:39:04,065 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:39:04,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:39:04,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.12 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:39:04,066 INFO L168 Benchmark]: Boogie Preprocessor took 31.83 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 11:39:04,066 INFO L168 Benchmark]: RCFGBuilder took 1126.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:39:04,066 INFO L168 Benchmark]: TraceAbstraction took 39362.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 786.3 MB in the end (delta: 287.8 MB). Peak memory consumption was 287.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:39:04,066 INFO L168 Benchmark]: Witness Printer took 49.89 ms. Allocated memory is still 1.1 GB. Free memory is still 786.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:39:04,068 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.12 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.83 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1126.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39362.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 786.3 MB in the end (delta: 287.8 MB). Peak memory consumption was 287.8 MB. Max. memory is 11.5 GB. * Witness Printer took 49.89 ms. Allocated memory is still 1.1 GB. Free memory is still 786.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 1 error locations. SAFE Result, 39.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 216 SDslu, 421 SDs, 0 SdLazy, 368 SolverSat, 31 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 21 NumberOfFragments, 49 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 123 ConstructedInterpolants, 26 QuantifiedInterpolants, 22454 SizeOfPredicates, 20 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...