./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1052b_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_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 62b7dc6392161c86b172facfcbc82e25c42dc2f4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 62b7dc6392161c86b172facfcbc82e25c42dc2f4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_7 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:13:14,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:13:14,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:13:14,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:13:14,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:13:14,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:13:14,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:13:14,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:13:14,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:13:14,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:13:14,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:13:14,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:13:14,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:13:14,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:13:14,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:13:14,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:13:14,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:13:14,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:13:14,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:13:14,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:13:14,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:13:14,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:13:14,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:13:14,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:13:14,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:13:14,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:13:14,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:13:14,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:13:14,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:13:14,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:13:14,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:13:14,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:13:14,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:13:14,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:13:14,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:13:14,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:13:14,463 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 08:13:14,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:13:14,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:13:14,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:13:14,474 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:13:14,474 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:13:14,474 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:13:14,474 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:13:14,474 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:13:14,474 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:13:14,475 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:13:14,475 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:13:14,475 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:13:14,475 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:13:14,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:13:14,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:13:14,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:13:14,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:13:14,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:13:14,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:13:14,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:13:14,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:13:14,479 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_6077164b-9793-420a-96f2-e9f4edd9d92f/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 -> 62b7dc6392161c86b172facfcbc82e25c42dc2f4 [2018-11-23 08:13:14,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:13:14,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:13:14,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:13:14,512 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:13:14,512 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:13:14,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:14,549 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/58a9b1c94/5b6b08899261458c8aef760794f976ef/FLAG6309e1814 [2018-11-23 08:13:14,859 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:13:14,860 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:14,864 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/58a9b1c94/5b6b08899261458c8aef760794f976ef/FLAG6309e1814 [2018-11-23 08:13:14,873 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/58a9b1c94/5b6b08899261458c8aef760794f976ef [2018-11-23 08:13:14,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:13:14,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:13:14,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:13:14,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:13:14,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:13:14,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:13:14" (1/1) ... [2018-11-23 08:13:14,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e65e346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:14, skipping insertion in model container [2018-11-23 08:13:14,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:13:14" (1/1) ... [2018-11-23 08:13:14,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:13:14,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:13:15,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:13:15,074 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:13:15,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:13:15,120 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:13:15,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15 WrapperNode [2018-11-23 08:13:15,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:13:15,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:13:15,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:13:15,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:13:15,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:13:15,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:13:15,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:13:15,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:13:15,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... [2018-11-23 08:13:15,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:13:15,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:13:15,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:13:15,218 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:13:15,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 08:13:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 08:13:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:13:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-11-23 08:13:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-11-23 08:13:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:13:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 08:13:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:13:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:13:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:13:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:13:15,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:13:15,500 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 08:13:15,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:13:15 BoogieIcfgContainer [2018-11-23 08:13:15,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:13:15,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:13:15,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:13:15,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:13:15,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:13:14" (1/3) ... [2018-11-23 08:13:15,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5550c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:13:15, skipping insertion in model container [2018-11-23 08:13:15,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:15" (2/3) ... [2018-11-23 08:13:15,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5550c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:13:15, skipping insertion in model container [2018-11-23 08:13:15,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:13:15" (3/3) ... [2018-11-23 08:13:15,508 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:15,515 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:13:15,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:13:15,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:13:15,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:13:15,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:13:15,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:13:15,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:13:15,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:13:15,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:13:15,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:13:15,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:13:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 08:13:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:13:15,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:15,580 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 08:13:15,582 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:15,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2000118749, now seen corresponding path program 1 times [2018-11-23 08:13:15,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:13:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:13:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:13:15,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:13:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:13:15,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:13:15,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:13:15,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:13:15,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 08:13:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 08:13:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:13:15,728 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 08:13:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:13:15,746 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2018-11-23 08:13:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 08:13:15,747 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 08:13:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:13:15,754 INFO L225 Difference]: With dead ends: 92 [2018-11-23 08:13:15,754 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 08:13:15,757 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 08:13:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 08:13:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 08:13:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 08:13:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-11-23 08:13:15,797 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 25 [2018-11-23 08:13:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:13:15,797 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 08:13:15,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 08:13:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-11-23 08:13:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 08:13:15,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:15,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:13:15,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:15,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash 784957124, now seen corresponding path program 1 times [2018-11-23 08:13:15,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:13:15,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:13:15,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:15,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:13:15,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:13:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:13:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:13:15,935 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2147483658, |#NULL.offset|=2147483650, |old(#NULL.base)|=2147483658, |old(#NULL.offset)|=2147483650, |old(~huge_floor~0)|=2147483654.0, ~huge_floor~0=2147483654.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E300; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483658, |old(#NULL.offset)|=2147483650, |old(~huge_floor~0)|=2147483654.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483658, |old(#NULL.offset)|=2147483650, |old(~huge_floor~0)|=2147483654.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #142#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret10 := floor_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0;havoc ~j~0; VAL [floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~j0~0 < 20; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~j0~0=0, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(~j0~0 < 0);~i~0 := ~shiftRight(1048575, ~j0~0); VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~j0~0=0, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296;#res := ~x; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~j0~0=0, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, |floor_double_#res|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [floor_double_~i0~0=(- 2147483648), floor_double_~i1~0=3, floor_double_~j0~0=0, floor_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=2147483659.0, |floor_double_#res|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #146#return; VAL [main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=2147483659.0, main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret11 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem6;havoc #t~union7;call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union9;havoc #t~mem8;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=1, isinf_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=1, isinf_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, |isinf_double_#res|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=2147483659.0, |isinf_double_#res|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #148#return; VAL [main_~res~0=2147483659.0, main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=2147483659.0, main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=2147483659.0, main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=2147483659.0, main_~x~0=2147483659.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483658, #NULL.offset=2147483650, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26-L69] assume ~j0~0 < 20; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27-L46] assume !(~j0~0 < 0); [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38-L39] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L16-L77] ensures true; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L84] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L85] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L83] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L80-L92] ensures true; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105-L108] assume 0 == #t~ret11; [L105] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483658, #NULL.offset=2147483650, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483658, old(#NULL.offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26-L69] assume ~j0~0 < 20; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27-L46] assume !(~j0~0 < 0); [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38-L39] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L16-L77] ensures true; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L84] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L85] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L83] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L80-L92] ensures true; VAL [#in~x=2.147483659E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105-L108] assume 0 == #t~ret11; [L105] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483658, #NULL!offset=2147483650, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L84] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L83] havoc ~#ew_u~1; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] COND TRUE 0 == #t~ret11 [L105] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483658, #NULL!offset=2147483650, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L84] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L83] havoc ~#ew_u~1; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] COND TRUE 0 == #t~ret11 [L105] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483658, #NULL!offset=2147483650, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L84] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L83] havoc ~#ew_u~1; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] COND TRUE 0 == #t~ret11 [L105] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483658, #NULL!offset=2147483650, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=2.147483654E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483658, old(#NULL!offset)=2147483650, old(~huge_floor~0)=2.147483654E9, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L101] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] CALL call #t~ret10 := floor_double(~x~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~x=2.147483659E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=2.147483659E9, ~huge_floor~0=1.0E300, ~i0~0=-2147483648, ~i1~0=3, ~j0~0=0, ~x=2.147483659E9] [L102] RET call #t~ret10 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=2.147483659E9, ~huge_floor~0=1.0E300, ~x~0=2.147483659E9] [L102] ~res~0 := #t~ret10; [L102] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L80-L92] ~x := #in~x; [L81] havoc ~hx~0; [L81] havoc ~lx~0; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=2.147483659E9] [L83] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L84] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L85] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L85] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L85] havoc #t~mem6; [L85] havoc #t~union7; [L86] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L86] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union9; [L86] havoc #t~mem8; [L83] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L83] havoc ~#ew_u~1; VAL [#in~x=2.147483659E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~hx~0=-2147483648, ~lx~0=1, ~x=2.147483659E9] [L88] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L89] ~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); [L90] ~hx~0 := 2146435072 - ~hx~0; [L91] #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=2.147483659E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_floor~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=2.147483659E9] [L105] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L105] COND TRUE 0 == #t~ret11 [L105] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=2.147483659E9, ~x~0=2.147483659E9] [L14] static const double huge_floor = 1.0e300; VAL [\old(huge_floor)=2147483654, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L101] double x = -1.0 / 0.0; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L102] CALL, EXPR floor_double(x) VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, x=2147483659] [L26] COND TRUE j0 < 20 VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L27] COND FALSE !(j0 < 0) [L37] i = (0x000fffff) >> j0 VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L38] COND TRUE ((i0 & i) | i1) == 0 [L39] return x; VAL [\old(x)=2147483659, \result=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L102] RET, EXPR floor_double(x) VAL [floor_double(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L102] double res = floor_double(x); [L105] CALL, EXPR isinf_double(res) VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L81] __int32_t hx, lx; VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L83] ieee_double_shape_type ew_u; [L84] ew_u.value = (x) [L85] EXPR ew_u.parts.msw [L85] (hx) = ew_u.parts.msw [L86] EXPR ew_u.parts.lsw [L86] (lx) = ew_u.parts.lsw [L88] hx &= 0x7fffffff [L89] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L90] hx = 0x7ff00000 - hx [L91] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=2147483659, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=2147483659] [L105] RET, EXPR isinf_double(res) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=2147483659, x=2147483659] [L105] COND TRUE !isinf_double(res) [L106] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=2147483659, x=2147483659] ----- [2018-11-23 08:13:16,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:13:16 BoogieIcfgContainer [2018-11-23 08:13:16,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:13:16,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:13:16,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:13:16,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:13:16,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:13:15" (3/4) ... [2018-11-23 08:13:16,017 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:13:16,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:13:16,018 INFO L168 Benchmark]: Toolchain (without parser) took 1141.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,019 INFO L168 Benchmark]: CDTParser took 0.13 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 08:13:16,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.19 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.12 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,021 INFO L168 Benchmark]: Boogie Preprocessor took 76.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,023 INFO L168 Benchmark]: RCFGBuilder took 283.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,023 INFO L168 Benchmark]: TraceAbstraction took 508.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:16,024 INFO L168 Benchmark]: Witness Printer took 6.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:13:16,029 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.13 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 243.19 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.12 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 283.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 508.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 106]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 37, overapproximation of bitwiseOr at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 101, overapproximation of bitwiseAnd at line 88. Possible FailurePath: [L14] static const double huge_floor = 1.0e300; VAL [\old(huge_floor)=2147483654, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L101] double x = -1.0 / 0.0; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L102] CALL, EXPR floor_double(x) VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, x=2147483659] [L26] COND TRUE j0 < 20 VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L27] COND FALSE !(j0 < 0) [L37] i = (0x000fffff) >> j0 VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L38] COND TRUE ((i0 & i) | i1) == 0 [L39] return x; VAL [\old(x)=2147483659, \result=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=3, j0=0, x=2147483659] [L102] RET, EXPR floor_double(x) VAL [floor_double(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L102] double res = floor_double(x); [L105] CALL, EXPR isinf_double(res) VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L81] __int32_t hx, lx; VAL [\old(x)=2147483659, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=2147483659] [L83] ieee_double_shape_type ew_u; [L84] ew_u.value = (x) [L85] EXPR ew_u.parts.msw [L85] (hx) = ew_u.parts.msw [L86] EXPR ew_u.parts.lsw [L86] (lx) = ew_u.parts.lsw [L88] hx &= 0x7fffffff [L89] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L90] hx = 0x7ff00000 - hx [L91] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=2147483659, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=2147483659] [L105] RET, EXPR isinf_double(res) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=2147483659, x=2147483659] [L105] COND TRUE !isinf_double(res) [L106] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=2147483659, x=2147483659] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 08:13:17,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:13:17,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:13:17,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:13:17,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:13:17,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:13:17,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:13:17,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:13:17,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:13:17,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:13:17,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:13:17,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:13:17,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:13:17,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:13:17,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:13:17,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:13:17,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:13:17,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:13:17,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:13:17,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:13:17,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:13:17,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:13:17,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:13:17,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:13:17,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:13:17,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:13:17,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:13:17,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:13:17,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:13:17,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:13:17,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:13:17,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:13:17,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:13:17,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:13:17,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:13:17,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:13:17,729 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 08:13:17,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:13:17,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:13:17,740 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:13:17,740 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:13:17,740 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:13:17,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:13:17,740 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:13:17,740 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:13:17,740 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:13:17,741 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:13:17,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:13:17,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:13:17,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:13:17,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:13:17,742 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:13:17,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:13:17,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:13:17,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:13:17,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:13:17,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:13:17,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:13:17,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:13:17,744 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:13:17,744 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_6077164b-9793-420a-96f2-e9f4edd9d92f/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 -> 62b7dc6392161c86b172facfcbc82e25c42dc2f4 [2018-11-23 08:13:17,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:13:17,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:13:17,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:13:17,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:13:17,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:13:17,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:17,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/e7c64a269/5f599a3e0c764ddc993cc15cebf74609/FLAG66aefd15b [2018-11-23 08:13:18,163 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:13:18,164 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/sv-benchmarks/c/float-newlib/double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:18,168 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/e7c64a269/5f599a3e0c764ddc993cc15cebf74609/FLAG66aefd15b [2018-11-23 08:13:18,590 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/data/e7c64a269/5f599a3e0c764ddc993cc15cebf74609 [2018-11-23 08:13:18,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:13:18,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:13:18,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:13:18,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:13:18,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:13:18,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d872129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18, skipping insertion in model container [2018-11-23 08:13:18,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:13:18,624 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:13:18,762 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:13:18,766 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:13:18,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:13:18,810 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:13:18,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18 WrapperNode [2018-11-23 08:13:18,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:13:18,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:13:18,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:13:18,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:13:18,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:13:18,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:13:18,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:13:18,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:13:18,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... [2018-11-23 08:13:18,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:13:18,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:13:18,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:13:18,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:13:18,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 08:13:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-11-23 08:13:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-11-23 08:13:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 08:13:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:13:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:13:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:13:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 08:13:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 08:13:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 08:13:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 08:13:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:13:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:13:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:13:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:13:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 08:13:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:13:19,043 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:13:19,774 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:13:19,794 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:13:19,794 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 08:13:19,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:13:19 BoogieIcfgContainer [2018-11-23 08:13:19,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:13:19,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:13:19,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:13:19,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:13:19,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:13:18" (1/3) ... [2018-11-23 08:13:19,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dad7a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:13:19, skipping insertion in model container [2018-11-23 08:13:19,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:13:18" (2/3) ... [2018-11-23 08:13:19,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dad7a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:13:19, skipping insertion in model container [2018-11-23 08:13:19,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:13:19" (3/3) ... [2018-11-23 08:13:19,803 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052b_true-unreach-call.c [2018-11-23 08:13:19,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:13:19,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:13:19,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:13:19,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:13:19,848 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:13:19,848 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:13:19,848 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:13:19,848 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:13:19,848 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:13:19,848 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:13:19,849 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:13:19,849 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:13:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 08:13:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:13:19,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:19,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:13:19,864 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:19,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1867492039, now seen corresponding path program 1 times [2018-11-23 08:13:19,870 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:13:19,870 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 08:13:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:19,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:13:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:13:19,938 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:13:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:13:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:13:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 08:13:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 08:13:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:13:19,963 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 08:13:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:13:19,979 INFO L93 Difference]: Finished difference Result 90 states and 133 transitions. [2018-11-23 08:13:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 08:13:19,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 08:13:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:13:19,986 INFO L225 Difference]: With dead ends: 90 [2018-11-23 08:13:19,986 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 08:13:19,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:13:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 08:13:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 08:13:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 08:13:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-11-23 08:13:20,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 24 [2018-11-23 08:13:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:13:20,020 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-23 08:13:20,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 08:13:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 08:13:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:13:20,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:20,021 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 08:13:20,021 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:20,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash 367307714, now seen corresponding path program 1 times [2018-11-23 08:13:20,022 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:13:20,022 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/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 08:13:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:20,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:13:20,179 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:20,182 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:20,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:13:20,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 08:13:20,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:20,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 08:13:20,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 08:13:20,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:20,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:20,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:20,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:13:20,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:13:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:13:20,414 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:13:20,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:13:20,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:13:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:13:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:13:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:13:20,423 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 7 states. [2018-11-23 08:13:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:13:22,396 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-11-23 08:13:22,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 08:13:22,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 08:13:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:13:22,399 INFO L225 Difference]: With dead ends: 78 [2018-11-23 08:13:22,400 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 08:13:22,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 08:13:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 08:13:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-23 08:13:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 08:13:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-23 08:13:22,409 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 26 [2018-11-23 08:13:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:13:22,410 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-23 08:13:22,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:13:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 08:13:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:13:22,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:22,410 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 08:13:22,411 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:22,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1950262155, now seen corresponding path program 1 times [2018-11-23 08:13:22,411 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:13:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 08:13:22,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:22,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:13:22,515 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:22,515 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:22,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:13:22,546 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:22,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 08:13:22,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:22,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 08:13:22,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 08:13:22,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:22,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:22,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:22,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:13:22,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:13:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:13:22,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:13:22,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:13:22,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:13:22,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:13:22,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:13:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:13:22,673 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 7 states. [2018-11-23 08:13:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:13:23,577 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-23 08:13:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:13:23,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 08:13:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:13:23,578 INFO L225 Difference]: With dead ends: 59 [2018-11-23 08:13:23,578 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 08:13:23,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 08:13:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 08:13:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 08:13:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 08:13:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 08:13:23,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2018-11-23 08:13:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:13:23,582 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 08:13:23,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:13:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 08:13:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:13:23,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:23,583 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 08:13:23,583 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:23,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1356700012, now seen corresponding path program 1 times [2018-11-23 08:13:23,584 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:13:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 08:13:23,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:23,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:13:23,687 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:23,688 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:23,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 08:13:23,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 08:13:23,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:23,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 08:13:23,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 08:13:23,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:13:23,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:23,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:13:23,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:13:23,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:13:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:13:23,820 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:13:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:13:23,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:13:23,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:13:23,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:13:23,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:13:23,828 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-23 08:13:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:13:24,192 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-11-23 08:13:24,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:13:24,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 08:13:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:13:24,196 INFO L225 Difference]: With dead ends: 40 [2018-11-23 08:13:24,196 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 08:13:24,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 08:13:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 08:13:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 08:13:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 08:13:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 08:13:24,200 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2018-11-23 08:13:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:13:24,200 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 08:13:24,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:13:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 08:13:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:13:24,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:13:24,201 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 08:13:24,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:13:24,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:13:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1650103019, now seen corresponding path program 1 times [2018-11-23 08:13:24,201 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:13:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6077164b-9793-420a-96f2-e9f4edd9d92f/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 08:13:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:13:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:13:24,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:13:24,838 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-23 08:13:25,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:25,218 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:25,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:25,220 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:13:25,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 08:13:25,497 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2018-11-23 08:13:25,498 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_7 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) 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 08:13:25,500 INFO L168 Benchmark]: Toolchain (without parser) took 6907.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 942.5 MB in the beginning and 862.9 MB in the end (delta: 79.6 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:25,500 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:13:25,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.75 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:25,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.44 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:13:25,501 INFO L168 Benchmark]: Boogie Preprocessor took 65.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:25,502 INFO L168 Benchmark]: RCFGBuilder took 900.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:25,502 INFO L168 Benchmark]: TraceAbstraction took 5704.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:13:25,504 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.15 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 216.75 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.44 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 900.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5704.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.9 MB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 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_7 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_7 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)): 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...