./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 dbff84b908ff01b4d2841315a486ca175d7dad80 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 dbff84b908ff01b4d2841315a486ca175d7dad80 ............................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_10)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:08:39,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:08:39,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:08:39,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:08:39,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:08:39,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:08:39,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:08:39,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:08:39,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:08:39,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:08:39,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:08:39,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:08:39,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:08:39,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:08:39,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:08:39,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:08:39,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:08:39,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:08:39,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:08:39,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:08:39,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:08:39,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:08:39,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:08:39,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:08:39,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:08:39,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:08:39,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:08:39,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:08:39,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:08:39,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:08:39,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:08:39,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:08:39,042 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:08:39,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:08:39,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:08:39,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:08:39,044 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 04:08:39,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:08:39,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:08:39,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:08:39,055 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:08:39,056 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:08:39,056 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:08:39,056 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:08:39,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:08:39,056 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:08:39,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:08:39,058 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:08:39,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:08:39,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:08:39,059 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:08:39,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:08:39,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:08:39,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:08:39,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:08:39,059 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_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 -> dbff84b908ff01b4d2841315a486ca175d7dad80 [2018-11-23 04:08:39,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:08:39,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:08:39,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:08:39,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:08:39,095 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:08:39,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:39,135 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/3876122c5/ab2bf7592b614138bd01ed8883e5132c/FLAGab6465659 [2018-11-23 04:08:39,541 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:08:39,541 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:39,546 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/3876122c5/ab2bf7592b614138bd01ed8883e5132c/FLAGab6465659 [2018-11-23 04:08:39,556 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/3876122c5/ab2bf7592b614138bd01ed8883e5132c [2018-11-23 04:08:39,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:08:39,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:08:39,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:08:39,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:08:39,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:08:39,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39, skipping insertion in model container [2018-11-23 04:08:39,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:08:39,583 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:08:39,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:08:39,705 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:08:39,726 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:08:39,739 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:08:39,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39 WrapperNode [2018-11-23 04:08:39,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:08:39,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:08:39,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:08:39,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:08:39,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:08:39,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:08:39,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:08:39,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:08:39,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... [2018-11-23 04:08:39,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:08:39,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:08:39,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:08:39,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:08:39,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 04:08:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 04:08:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 04:08:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:08:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:08:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 04:08:39,860 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 04:08:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 04:08:39,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:08:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:08:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:08:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:08:40,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:08:40,113 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 04:08:40,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:40 BoogieIcfgContainer [2018-11-23 04:08:40,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:08:40,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:08:40,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:08:40,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:08:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:08:39" (1/3) ... [2018-11-23 04:08:40,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f60ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:40, skipping insertion in model container [2018-11-23 04:08:40,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:39" (2/3) ... [2018-11-23 04:08:40,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f60ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:40, skipping insertion in model container [2018-11-23 04:08:40,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:40" (3/3) ... [2018-11-23 04:08:40,120 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:40,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:08:40,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:08:40,150 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:08:40,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:08:40,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:08:40,176 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:08:40,176 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:08:40,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:08:40,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:08:40,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:08:40,176 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:08:40,176 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:08:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 04:08:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:08:40,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:08:40,195 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 04:08:40,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:08:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:08:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 15091843, now seen corresponding path program 1 times [2018-11-23 04:08:40,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:08:40,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:08:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:08:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:08:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:08:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:08:40,303 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 04:08:40,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:08:40,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:08:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 04:08:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:08:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:08:40,318 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 04:08:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:08:40,335 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2018-11-23 04:08:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:08:40,336 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 04:08:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:08:40,344 INFO L225 Difference]: With dead ends: 72 [2018-11-23 04:08:40,344 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 04:08:40,347 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 04:08:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 04:08:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 04:08:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 04:08:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 04:08:40,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2018-11-23 04:08:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:08:40,370 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 04:08:40,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 04:08:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 04:08:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 04:08:40,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:08:40,371 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 04:08:40,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:08:40,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:08:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 458172363, now seen corresponding path program 1 times [2018-11-23 04:08:40,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:08:40,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:08:40,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:08:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:08:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:08:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:08:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:08:40,496 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450953, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450946] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450946] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450953, |old(#NULL.offset)|=6442450946] [?] RET #104#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret16 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret14 := trunc_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] ~x := #in~x;havoc ~signbit~0;havoc ~msw~0;havoc ~lsw~0;havoc ~exponent_less_1023~0; VAL [trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.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);~msw~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~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;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 [trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] goto; VAL [trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume !(~exponent_less_1023~0 < 20); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume ~exponent_less_1023~0 > 51; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume 1024 == ~exponent_less_1023~0;#res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume true; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450954, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] RET #108#return; VAL [main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret14|=6442450950.0] [?] ~res~0 := #t~ret14;havoc #t~ret14; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret15 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.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~mem10 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union11, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union11;havoc #t~mem10;call #t~mem12 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union13, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem12;havoc #t~union13;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=2147483647, isinf_double_~lx~0=2, isinf_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.0] [?] goto; VAL [isinf_double_~hx~0=2147483647, isinf_double_~lx~0=2, isinf_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.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=2146435073, isinf_double_~lx~0=2, isinf_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.0, |isinf_double_#res|=0] [?] assume true; VAL [isinf_double_~hx~0=2146435073, isinf_double_~lx~0=2, isinf_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450950.0, |isinf_double_#res|=0] [?] RET #110#return; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=0] [?] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=0] [?] assume 0 == #t~ret15;havoc #t~ret15; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450946, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L17-L60] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~x=6.44245095E9] [L66] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L67] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L68] call #t~mem10 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] call write~real(#t~union11, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] call #t~mem12 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(#t~union13, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L66] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L63-L75] ensures true; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88-L91] assume 0 == #t~ret15; [L88] havoc #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450953, #NULL.offset=6442450946, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450953, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L17-L60] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~x=6.44245095E9] [L66] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L67] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L68] call #t~mem10 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] call write~real(#t~union11, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] call #t~mem12 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(#t~union13, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L66] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L63-L75] ensures true; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88-L91] assume 0 == #t~ret15; [L88] havoc #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450946, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~x=6.44245095E9] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450946, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~x=6.44245095E9] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450946, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~x=6.44245095E9] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450953, #NULL!offset=6442450946, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450953, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L84] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L85] CALL call #t~ret14 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450954, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450954, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L85] RET call #t~ret14 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=6.44245095E9, ~x~0=6.442450945E9] [L85] ~res~0 := #t~ret14; [L85] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] CALL call #t~ret15 := isinf_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0] [L63-L75] ~x := #in~x; [L64] havoc ~hx~0; [L64] havoc ~lx~0; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~x=6.44245095E9] [L66] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L67] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] FCALL call #t~mem10 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L68] ~hx~0 := (if #t~mem10 % 4294967296 % 4294967296 <= 2147483647 then #t~mem10 % 4294967296 % 4294967296 else #t~mem10 % 4294967296 % 4294967296 - 4294967296); [L68] FCALL call write~real(#t~union11, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L68] havoc #t~union11; [L68] havoc #t~mem10; [L69] FCALL call #t~mem12 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L69] ~lx~0 := (if #t~mem12 % 4294967296 % 4294967296 <= 2147483647 then #t~mem12 % 4294967296 % 4294967296 else #t~mem12 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union13, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~mem12; [L69] havoc #t~union13; [L66] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L66] havoc ~#ew_u~1; VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=2, ~x=6.44245095E9] [L71] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L72] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L73] ~hx~0 := 2146435072 - ~hx~0; [L74] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=2, ~x=6.44245095E9] [L88] RET call #t~ret15 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L88] COND TRUE 0 == #t~ret15 [L88] havoc #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L89] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L84] double x = -1.0 / 0.0; [L85] CALL, EXPR trunc_double(x) VAL [\old(x)=6442450945] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=6442450945, x=6442450945] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L85] RET, EXPR trunc_double(x) VAL [trunc_double(x)=6442450950, x=6442450945] [L85] double res = trunc_double(x); [L88] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450950] [L64] __int32_t hx, lx; VAL [\old(x)=6442450950, x=6442450950] [L66] ieee_double_shape_type ew_u; [L67] ew_u.value = (x) [L68] EXPR ew_u.parts.msw [L68] (hx) = ew_u.parts.msw [L69] EXPR ew_u.parts.lsw [L69] (lx) = ew_u.parts.lsw [L71] hx &= 0x7fffffff [L72] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L73] hx = 0x7ff00000 - hx [L74] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450950, \result=0, hx=2146435073, lx=2, x=6442450950] [L88] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=6442450950, x=6442450945] [L88] COND TRUE !isinf_double(res) [L89] __VERIFIER_error() VAL [res=6442450950, x=6442450945] ----- [2018-11-23 04:08:40,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:08:40 BoogieIcfgContainer [2018-11-23 04:08:40,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:08:40,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:08:40,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:08:40,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:08:40,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:40" (3/4) ... [2018-11-23 04:08:40,544 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 04:08:40,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:08:40,545 INFO L168 Benchmark]: Toolchain (without parser) took 986.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:40,547 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:08:40,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:40,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:08:40,548 INFO L168 Benchmark]: Boogie Preprocessor took 67.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:40,549 INFO L168 Benchmark]: RCFGBuilder took 290.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:40,549 INFO L168 Benchmark]: TraceAbstraction took 425.39 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: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:40,550 INFO L168 Benchmark]: Witness Printer took 4.24 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 04:08:40,552 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 947.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 290.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 425.39 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: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 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: 89]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 72, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of bitwiseAnd at line 71. Possible FailurePath: [L84] double x = -1.0 / 0.0; [L85] CALL, EXPR trunc_double(x) VAL [\old(x)=6442450945] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=6442450945, x=6442450945] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483658, msw=-2147483648, signbit=-1, x=6442450945] [L85] RET, EXPR trunc_double(x) VAL [trunc_double(x)=6442450950, x=6442450945] [L85] double res = trunc_double(x); [L88] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450950] [L64] __int32_t hx, lx; VAL [\old(x)=6442450950, x=6442450950] [L66] ieee_double_shape_type ew_u; [L67] ew_u.value = (x) [L68] EXPR ew_u.parts.msw [L68] (hx) = ew_u.parts.msw [L69] EXPR ew_u.parts.lsw [L69] (lx) = ew_u.parts.lsw [L71] hx &= 0x7fffffff [L72] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L73] hx = 0x7ff00000 - hx [L74] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450950, \result=0, hx=2146435073, lx=2, x=6442450950] [L88] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=6442450950, x=6442450945] [L88] COND TRUE !isinf_double(res) [L89] __VERIFIER_error() VAL [res=6442450950, x=6442450945] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 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=40occurred 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 04:08:41,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:08:41,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:08:41,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:08:41,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:08:41,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:08:41,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:08:41,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:08:41,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:08:41,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:08:41,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:08:41,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:08:41,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:08:41,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:08:41,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:08:41,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:08:41,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:08:41,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:08:42,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:08:42,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:08:42,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:08:42,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:08:42,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:08:42,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:08:42,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:08:42,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:08:42,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:08:42,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:08:42,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:08:42,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:08:42,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:08:42,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:08:42,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:08:42,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:08:42,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:08:42,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:08:42,010 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 04:08:42,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:08:42,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:08:42,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:08:42,021 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:08:42,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:08:42,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:08:42,021 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:08:42,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:08:42,022 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:08:42,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:08:42,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:08:42,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 04:08:42,024 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:08:42,025 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 04:08:42,025 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 04:08:42,025 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_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 -> dbff84b908ff01b4d2841315a486ca175d7dad80 [2018-11-23 04:08:42,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:08:42,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:08:42,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:08:42,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:08:42,067 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:08:42,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:42,111 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/0d33a4cf7/009301d9bb004eeeaf1af45013ad06c4/FLAG097c8bf2e [2018-11-23 04:08:42,435 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:08:42,436 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/sv-benchmarks/c/float-newlib/double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:42,440 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/0d33a4cf7/009301d9bb004eeeaf1af45013ad06c4/FLAG097c8bf2e [2018-11-23 04:08:42,866 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/bin-2019/uautomizer/data/0d33a4cf7/009301d9bb004eeeaf1af45013ad06c4 [2018-11-23 04:08:42,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:08:42,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:08:42,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:08:42,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:08:42,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:08:42,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:42" (1/1) ... [2018-11-23 04:08:42,874 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 04:08:42, skipping insertion in model container [2018-11-23 04:08:42,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:42" (1/1) ... [2018-11-23 04:08:42,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:08:42,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:08:43,039 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:08:43,043 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:08:43,066 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:08:43,084 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:08:43,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43 WrapperNode [2018-11-23 04:08:43,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:08:43,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:08:43,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:08:43,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:08:43,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:08:43,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:08:43,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:08:43,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:08:43,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... [2018-11-23 04:08:43,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:08:43,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:08:43,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:08:43,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:08:43,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 04:08:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 04:08:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 04:08:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 04:08:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 04:08:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:08:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 04:08:43,206 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:08:43,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:08:43,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:08:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 04:08:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:08:43,313 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 04:08:43,446 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 04:08:43,472 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:08:43,472 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 04:08:43,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:43 BoogieIcfgContainer [2018-11-23 04:08:43,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:08:43,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:08:43,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:08:43,475 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:08:43,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:08:42" (1/3) ... [2018-11-23 04:08:43,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ef52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:43, skipping insertion in model container [2018-11-23 04:08:43,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:43" (2/3) ... [2018-11-23 04:08:43,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ef52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:43, skipping insertion in model container [2018-11-23 04:08:43,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:43" (3/3) ... [2018-11-23 04:08:43,478 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072d_true-unreach-call.c [2018-11-23 04:08:43,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:08:43,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:08:43,497 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:08:43,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:08:43,518 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:08:43,518 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:08:43,518 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:08:43,518 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:08:43,518 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:08:43,518 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:08:43,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:08:43,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:08:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 04:08:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 04:08:43,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:08:43,534 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 04:08:43,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:08:43,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:08:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash 109339129, now seen corresponding path program 1 times [2018-11-23 04:08:43,541 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 04:08:43,542 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 04:08:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:08:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:08:43,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:08:43,637 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 04:08:43,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:08:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:08:43,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:08:43,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 04:08:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:08:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:08:43,660 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 04:08:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:08:43,675 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2018-11-23 04:08:43,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:08:43,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 04:08:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:08:43,684 INFO L225 Difference]: With dead ends: 70 [2018-11-23 04:08:43,684 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 04:08:43,687 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 04:08:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 04:08:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 04:08:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 04:08:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 04:08:43,711 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2018-11-23 04:08:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:08:43,712 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 04:08:43,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 04:08:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 04:08:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:08:43,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:08:43,713 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 04:08:43,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:08:43,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:08:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 933504078, now seen corresponding path program 1 times [2018-11-23 04:08:43,714 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 04:08:43,714 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3e6228d-c643-49b9-a4c1-188e0594bdeb/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 04:08:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:08:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:08:43,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:08:44,678 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:08:44,679 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:08:44,680 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:08:44,681 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:08:44,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-11-23 04:08:44,887 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-11-23 04:08:44,888 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_10)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 04:08:44,891 INFO L168 Benchmark]: Toolchain (without parser) took 2022.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -88.9 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:44,891 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 04:08:44,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.15 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 04:08:44,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.20 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 04:08:44,892 INFO L168 Benchmark]: Boogie Preprocessor took 31.41 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 04:08:44,893 INFO L168 Benchmark]: RCFGBuilder took 337.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:44,893 INFO L168 Benchmark]: TraceAbstraction took 1416.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:08:44,895 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 215.15 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 19.20 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.41 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. * RCFGBuilder took 337.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1416.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_10)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_10)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...