./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_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_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 ......................................................................................................................................................................................................................................................................................................................................... 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_7)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:21:42,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:21:42,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:21:42,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:21:42,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:21:42,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:21:42,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:21:42,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:21:42,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:21:42,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:21:42,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:21:42,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:21:42,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:21:42,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:21:42,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:21:42,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:21:42,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:21:42,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:21:42,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:21:42,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:21:42,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:21:42,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:21:42,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:21:42,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:21:42,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:21:42,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:21:42,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:21:42,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:21:42,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:21:42,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:21:42,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:21:42,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:21:42,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:21:42,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:21:42,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:21:42,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:21:42,822 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:21:42,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:21:42,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:21:42,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:21:42,832 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:21:42,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:21:42,833 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:21:42,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:21:42,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:21:42,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:21:42,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:21:42,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:21:42,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:21:42,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:21:42,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:21:42,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:21:42,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:21:42,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:21:42,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:21:42,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:21:42,837 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan 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 -> Taipan 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 -> b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 [2018-11-23 14:21:42,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:21:42,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:21:42,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:21:42,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:21:42,873 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:21:42,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:42,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/de232ec8a/2166954f8ec74b5aa4bf0c8f1cc33b25/FLAG6064c78e4 [2018-11-23 14:21:43,316 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:21:43,316 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:43,320 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/de232ec8a/2166954f8ec74b5aa4bf0c8f1cc33b25/FLAG6064c78e4 [2018-11-23 14:21:43,329 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/de232ec8a/2166954f8ec74b5aa4bf0c8f1cc33b25 [2018-11-23 14:21:43,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:21:43,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:21:43,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:21:43,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:21:43,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:21:43,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f97056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43, skipping insertion in model container [2018-11-23 14:21:43,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:21:43,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:21:43,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:21:43,471 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:21:43,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:21:43,501 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:21:43,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43 WrapperNode [2018-11-23 14:21:43,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:21:43,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:21:43,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:21:43,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:21:43,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:21:43,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:21:43,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:21:43,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:21:43,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... [2018-11-23 14:21:43,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:21:43,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:21:43,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:21:43,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:21:43,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/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 14:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 14:21:43,606 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 14:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:21:43,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 14:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:21:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 14:21:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:21:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:21:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:21:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:21:43,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:21:43,754 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 14:21:43,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:43 BoogieIcfgContainer [2018-11-23 14:21:43,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:21:43,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:21:43,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:21:43,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:21:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:21:43" (1/3) ... [2018-11-23 14:21:43,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a48cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:43, skipping insertion in model container [2018-11-23 14:21:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:43" (2/3) ... [2018-11-23 14:21:43,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a48cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:43, skipping insertion in model container [2018-11-23 14:21:43,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:43" (3/3) ... [2018-11-23 14:21:43,759 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:43,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:21:43,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:21:43,781 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:21:43,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:21:43,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:21:43,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:21:43,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:21:43,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:21:43,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:21:43,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:21:43,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:21:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 14:21:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:21:43,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:21:43,815 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] [2018-11-23 14:21:43,817 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:21:43,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:21:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash -739558388, now seen corresponding path program 1 times [2018-11-23 14:21:43,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:21:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:21:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:21:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:21:43,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:21:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:21:43,917 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 14:21:43,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:21:43,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:21:43,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:21:43,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:21:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:21:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:21:43,936 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 14:21:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:21:43,950 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 14:21:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:21:43,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 14:21:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:21:43,956 INFO L225 Difference]: With dead ends: 54 [2018-11-23 14:21:43,956 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 14:21:43,958 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 14:21:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 14:21:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 14:21:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 14:21:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 14:21:43,979 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 23 [2018-11-23 14:21:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:21:43,980 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 14:21:43,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:21:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 14:21:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:21:43,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:21:43,981 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 14:21:43,981 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:21:43,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:21:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1668428866, now seen corresponding path program 1 times [2018-11-23 14:21:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:21:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:21:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:21:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:21:43,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:21:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:21:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:21:44,084 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450949, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450949, |old(#NULL.offset)|=6442450945] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450949, |old(#NULL.offset)|=6442450945] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450949, |old(#NULL.offset)|=6442450945] [?] RET #59#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := fabs_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] ~x := #in~x;havoc ~high~0; VAL [fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8);call #t~mem6 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4);~high~0 := #t~mem6;call write~real(#t~union7, ~#gh_u~1.base, ~#gh_u~1.offset, 8);havoc #t~mem6;havoc #t~union7;call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset);havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] goto; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);call #t~mem8 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8);~x := #t~mem8;call write~int(#t~union9.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4);call write~int(#t~union9.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);havoc #t~mem8;havoc #t~union9.lsw, #t~union9.msw;call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset);havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] goto; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0] [?] #res := ~x; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0, |fabs_double_#res|=6442450952.0] [?] assume true; VAL [fabs_double_~high~0=6442450962, fabs_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=6442450952.0, |fabs_double_#res|=6442450952.0] [?] RET #63#return; VAL [main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=6442450952.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=6442450952.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.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~mem2 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call #t~mem4 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union5;havoc #t~mem4;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.0] [?] goto; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.0, |isinf_double_#res|=0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450952.0, |isinf_double_#res|=0] [?] RET #65#return; VAL [main_~res~0=6442450952.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=6442450952.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=6442450952.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450952.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450949, #NULL.offset=6442450945, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450952E9] [L47] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L48] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L49] call #t~mem6 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L49] ~high~0 := #t~mem6; [L49] call write~real(#t~union7, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L47] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L53] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L54] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L55] call #t~mem8 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L55] ~x := #t~mem8; [L55] call write~int(#t~union9.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L55] call write~int(#t~union9.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9.lsw, #t~union9.msw; [L52] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L52] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L44-L58] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450952E9] [L33] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L35] call #t~mem2 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] call #t~mem4 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(#t~union5, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L33] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L30-L42] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72-L75] assume 0 == #t~ret11; [L72] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450949, #NULL.offset=6442450945, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450949, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450952E9] [L47] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L48] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L49] call #t~mem6 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L49] ~high~0 := #t~mem6; [L49] call write~real(#t~union7, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L47] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L53] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L54] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L55] call #t~mem8 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L55] ~x := #t~mem8; [L55] call write~int(#t~union9.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L55] call write~int(#t~union9.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9.lsw, #t~union9.msw; [L52] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L52] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L44-L58] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450952E9] [L33] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L35] call #t~mem2 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] call #t~mem4 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(#t~union5, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L33] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L30-L42] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72-L75] assume 0 == #t~ret11; [L72] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450949, #NULL!offset=6442450945, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450949, #NULL!offset=6442450945, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450949, #NULL!offset=6442450945, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450949, #NULL!offset=6442450945, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450949, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret10 := fabs_double(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~high~0=6442450962, ~x=6.442450952E9] [L57] #res := ~x; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, #res=6.442450952E9, ~high~0=6442450962, ~x=6.442450952E9] [L69] RET call #t~ret10 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450952E9, ~x~0=6.442450952E9] [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0] [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450952E9] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2, ~lx~0=-2147483648, ~x=6.442450952E9] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~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); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #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.442450952E9, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=6.442450952E9] [L72] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450952E9, ~x~0=6.442450952E9] [L68] double x = 1.0 / 0.0; [L69] CALL, EXPR fabs_double(x) VAL [\old(x)=6442450952] [L45] __uint32_t high; VAL [\old(x)=6442450952, x=6442450952] [L47] ieee_double_shape_type gh_u; [L48] gh_u.value = (x) [L49] EXPR gh_u.parts.msw [L49] (high) = gh_u.parts.msw [L52] ieee_double_shape_type sh_u; [L53] sh_u.value = (x) [L54] sh_u.parts.msw = (high & 0x7fffffff) [L55] EXPR sh_u.value [L55] (x) = sh_u.value [L57] return x; VAL [\old(x)=6442450952, \result=6442450952, high=2147483666, x=6442450952] [L69] RET, EXPR fabs_double(x) VAL [fabs_double(x)=6442450952, x=6442450952] [L69] double res = fabs_double(x); [L72] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450952] [L31] __int32_t hx, lx; VAL [\old(x)=6442450952, x=6442450952] [L33] ieee_double_shape_type ew_u; [L34] ew_u.value = (x) [L35] EXPR ew_u.parts.msw [L35] (hx) = ew_u.parts.msw [L36] EXPR ew_u.parts.lsw [L36] (lx) = ew_u.parts.lsw [L38] hx &= 0x7fffffff [L39] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L40] hx = 0x7ff00000 - hx [L41] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450952, \result=0, hx=2146435072, lx=-2147483648, x=6442450952] [L72] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=6442450952, x=6442450952] [L72] COND TRUE !isinf_double(res) [L73] __VERIFIER_error() VAL [res=6442450952, x=6442450952] ----- [2018-11-23 14:21:44,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:21:44 BoogieIcfgContainer [2018-11-23 14:21:44,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:21:44,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:21:44,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:21:44,121 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:21:44,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:43" (3/4) ... [2018-11-23 14:21:44,125 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:21:44,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:21:44,125 INFO L168 Benchmark]: Toolchain (without parser) took 793.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,127 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 14:21:44,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.48 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:21:44,128 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -239.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,129 INFO L168 Benchmark]: RCFGBuilder took 184.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,129 INFO L168 Benchmark]: TraceAbstraction took 365.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,130 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:44,133 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 169.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.48 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -239.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 365.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 73]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of bitwiseAnd at line 38. Possible FailurePath: [L68] double x = 1.0 / 0.0; [L69] CALL, EXPR fabs_double(x) VAL [\old(x)=6442450952] [L45] __uint32_t high; VAL [\old(x)=6442450952, x=6442450952] [L47] ieee_double_shape_type gh_u; [L48] gh_u.value = (x) [L49] EXPR gh_u.parts.msw [L49] (high) = gh_u.parts.msw [L52] ieee_double_shape_type sh_u; [L53] sh_u.value = (x) [L54] sh_u.parts.msw = (high & 0x7fffffff) [L55] EXPR sh_u.value [L55] (x) = sh_u.value [L57] return x; VAL [\old(x)=6442450952, \result=6442450952, high=2147483666, x=6442450952] [L69] RET, EXPR fabs_double(x) VAL [fabs_double(x)=6442450952, x=6442450952] [L69] double res = fabs_double(x); [L72] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450952] [L31] __int32_t hx, lx; VAL [\old(x)=6442450952, x=6442450952] [L33] ieee_double_shape_type ew_u; [L34] ew_u.value = (x) [L35] EXPR ew_u.parts.msw [L35] (hx) = ew_u.parts.msw [L36] EXPR ew_u.parts.lsw [L36] (lx) = ew_u.parts.lsw [L38] hx &= 0x7fffffff [L39] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L40] hx = 0x7ff00000 - hx [L41] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450952, \result=0, hx=2146435072, lx=-2147483648, x=6442450952] [L72] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=6442450952, x=6442450952] [L72] COND TRUE !isinf_double(res) [L73] __VERIFIER_error() VAL [res=6442450952, x=6442450952] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 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=31occurred 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, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 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 14:21:45,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:21:45,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:21:45,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:21:45,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:21:45,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:21:45,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:21:45,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:21:45,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:21:45,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:21:45,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:21:45,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:21:45,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:21:45,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:21:45,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:21:45,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:21:45,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:21:45,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:21:45,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:21:45,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:21:45,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:21:45,545 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:21:45,547 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:21:45,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:21:45,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:21:45,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:21:45,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:21:45,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:21:45,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:21:45,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:21:45,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:21:45,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:21:45,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:21:45,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:21:45,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:21:45,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:21:45,553 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 14:21:45,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:21:45,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:21:45,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:21:45,565 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:21:45,565 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:21:45,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:21:45,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:21:45,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:21:45,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:21:45,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:21:45,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:21:45,567 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:21:45,567 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:21:45,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:21:45,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:21:45,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:21:45,569 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:21:45,570 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:21:45,570 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_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan 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 -> Taipan 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 -> b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 [2018-11-23 14:21:45,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:21:45,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:21:45,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:21:45,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:21:45,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:21:45,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:45,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/c9aae6a00/66cb902bbc264b4f8c53bfa4fe841ede/FLAG6ce172f92 [2018-11-23 14:21:46,041 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:21:46,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:46,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/c9aae6a00/66cb902bbc264b4f8c53bfa4fe841ede/FLAG6ce172f92 [2018-11-23 14:21:46,055 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/data/c9aae6a00/66cb902bbc264b4f8c53bfa4fe841ede [2018-11-23 14:21:46,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:21:46,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:21:46,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:21:46,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:21:46,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:21:46,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b4c4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46, skipping insertion in model container [2018-11-23 14:21:46,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:21:46,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:21:46,209 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:21:46,212 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:21:46,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:21:46,250 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:21:46,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46 WrapperNode [2018-11-23 14:21:46,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:21:46,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:21:46,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:21:46,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:21:46,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:21:46,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:21:46,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:21:46,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:21:46,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... [2018-11-23 14:21:46,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:21:46,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:21:46,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:21:46,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:21:46,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/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 14:21:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 14:21:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 14:21:46,377 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:21:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 14:21:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:21:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:21:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:21:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:21:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 14:21:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:21:46,482 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:21:46,509 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:21:46,528 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:21:46,550 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:21:46,550 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 14:21:46,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:46 BoogieIcfgContainer [2018-11-23 14:21:46,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:21:46,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:21:46,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:21:46,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:21:46,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:21:46" (1/3) ... [2018-11-23 14:21:46,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d839ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:46, skipping insertion in model container [2018-11-23 14:21:46,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:46" (2/3) ... [2018-11-23 14:21:46,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d839ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:46, skipping insertion in model container [2018-11-23 14:21:46,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:46" (3/3) ... [2018-11-23 14:21:46,556 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1012a_true-unreach-call.c [2018-11-23 14:21:46,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:21:46,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:21:46,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:21:46,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:21:46,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:21:46,596 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:21:46,596 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:21:46,596 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:21:46,596 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:21:46,596 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:21:46,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:21:46,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:21:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 14:21:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:21:46,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:21:46,609 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] [2018-11-23 14:21:46,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:21:46,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:21:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 603222923, now seen corresponding path program 1 times [2018-11-23 14:21:46,616 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:21:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/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 14:21:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:21:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:21:46,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:21:46,684 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 14:21:46,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:21:46,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:21:46,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:21:46,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:21:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:21:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:21:46,703 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 14:21:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:21:46,718 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 14:21:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:21:46,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 14:21:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:21:46,724 INFO L225 Difference]: With dead ends: 52 [2018-11-23 14:21:46,724 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 14:21:46,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 14:21:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 14:21:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 14:21:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 14:21:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2018-11-23 14:21:46,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 22 [2018-11-23 14:21:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:21:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2018-11-23 14:21:46,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:21:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2018-11-23 14:21:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:21:46,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:21:46,757 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 14:21:46,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:21:46,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:21:46,758 INFO L82 PathProgramCache]: Analyzing trace with hash -460417459, now seen corresponding path program 1 times [2018-11-23 14:21:46,758 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:21:46,758 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9cf0d5f-507b-4c6c-b65d-d4edc217808f/bin-2019/utaipan/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 14:21:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:21:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:21:46,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:21:46,940 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:21:46,942 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:21:46,944 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:21:46,946 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:21:46,950 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 73 [2018-11-23 14:21:47,153 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-11-23 14:21:47,153 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_7)) 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 14:21:47,156 INFO L168 Benchmark]: Toolchain (without parser) took 1098.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:47,157 INFO L168 Benchmark]: CDTParser took 0.11 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 14:21:47,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:47,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.63 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:21:47,158 INFO L168 Benchmark]: Boogie Preprocessor took 21.54 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:21:47,159 INFO L168 Benchmark]: RCFGBuilder took 257.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:47,159 INFO L168 Benchmark]: TraceAbstraction took 604.09 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: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:21:47,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.63 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.54 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 257.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 604.09 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: 56.8 MB). Peak memory consumption was 56.8 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_7)) 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_7)): 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...