./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:12:27,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:12:27,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:12:27,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:12:27,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:12:27,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:12:27,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:12:27,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:12:27,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:12:27,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:12:27,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:12:27,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:12:27,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:12:27,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:12:27,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:12:27,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:12:27,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:12:27,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:12:27,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:12:27,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:12:27,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:12:27,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:12:27,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:12:27,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:12:27,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:12:27,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:12:27,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:12:27,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:12:27,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:12:27,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:12:27,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:12:27,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:12:27,161 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:12:27,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:12:27,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:12:27,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:12:27,162 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 01:12:27,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:12:27,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:12:27,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:12:27,173 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:12:27,173 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:12:27,174 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:12:27,174 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:12:27,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:12:27,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:12:27,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:12:27,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:12:27,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:12:27,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:12:27,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:12:27,176 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:12:27,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:12:27,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:12:27,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:12:27,177 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_176f212e-4a5a-48fa-a210-6d6eb6df03b2/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2018-11-23 01:12:27,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:12:27,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:12:27,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:12:27,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:12:27,210 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:12:27,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-23 01:12:27,246 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/data/0c92b11d9/f3612b2843974d41ac19163e79437a88/FLAG9a794d64f [2018-11-23 01:12:27,641 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:12:27,641 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-23 01:12:27,645 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/data/0c92b11d9/f3612b2843974d41ac19163e79437a88/FLAG9a794d64f [2018-11-23 01:12:27,654 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/data/0c92b11d9/f3612b2843974d41ac19163e79437a88 [2018-11-23 01:12:27,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:12:27,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:12:27,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:12:27,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:12:27,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:12:27,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6cc337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27, skipping insertion in model container [2018-11-23 01:12:27,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:12:27,678 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:12:27,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:12:27,785 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:12:27,795 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:12:27,808 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:12:27,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27 WrapperNode [2018-11-23 01:12:27,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:12:27,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:12:27,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:12:27,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:12:27,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:12:27,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:12:27,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:12:27,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:12:27,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... [2018-11-23 01:12:27,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:12:27,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:12:27,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:12:27,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:12:27,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/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 01:12:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:12:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:12:27,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-23 01:12:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:12:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:12:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:12:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 01:12:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-23 01:12:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-23 01:12:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:12:28,104 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:12:28,104 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 01:12:28,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:28 BoogieIcfgContainer [2018-11-23 01:12:28,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:12:28,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:12:28,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:12:28,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:12:28,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:27" (1/3) ... [2018-11-23 01:12:28,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b63e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:28, skipping insertion in model container [2018-11-23 01:12:28,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:27" (2/3) ... [2018-11-23 01:12:28,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b63e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:28, skipping insertion in model container [2018-11-23 01:12:28,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:28" (3/3) ... [2018-11-23 01:12:28,111 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2018-11-23 01:12:28,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:12:28,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-23 01:12:28,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-23 01:12:28,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:12:28,167 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 01:12:28,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:12:28,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:12:28,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:12:28,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:12:28,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:12:28,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:12:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 01:12:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:12:28,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:28,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:28,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:28,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2018-11-23 01:12:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:28,452 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 01:12:28,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:12:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:12:28,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:28,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:12:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:12:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:12:28,472 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 5 states. [2018-11-23 01:12:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:28,551 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 01:12:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:12:28,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 01:12:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:28,557 INFO L225 Difference]: With dead ends: 43 [2018-11-23 01:12:28,558 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 01:12:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:12:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 01:12:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 01:12:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 01:12:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 01:12:28,583 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2018-11-23 01:12:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:28,583 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 01:12:28,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:12:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 01:12:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:12:28,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:28,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:28,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:28,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2018-11-23 01:12:28,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:28,627 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 01:12:28,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:12:28,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:12:28,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:28,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:12:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:12:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:12:28,629 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2018-11-23 01:12:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:28,645 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 01:12:28,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:12:28,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 01:12:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:28,646 INFO L225 Difference]: With dead ends: 37 [2018-11-23 01:12:28,646 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 01:12:28,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:12:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 01:12:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 01:12:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 01:12:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 01:12:28,650 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2018-11-23 01:12:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:28,650 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 01:12:28,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:12:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 01:12:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:12:28,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:28,651 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:28,651 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:28,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2018-11-23 01:12:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:28,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:28,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:28,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-23 01:12:28,757 INFO L202 CegarAbsIntRunner]: [0], [1], [37], [45], [46], [48], [50], [56], [58], [59], [60], [62] [2018-11-23 01:12:28,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:12:28,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:12:28,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:12:28,905 INFO L272 AbstractInterpreter]: Visited 12 different actions 20 times. Merged at 4 different actions 8 times. Never widened. Performed 155 root evaluator evaluations with a maximum evaluation depth of 4. Performed 155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-23 01:12:28,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:28,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:12:28,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:28,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:28,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:28,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:28,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:28,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:12:28,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:28,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:12:28,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:12:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:29,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-11-23 01:12:29,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:29,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:12:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:12:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:12:29,154 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-23 01:12:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:29,236 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 01:12:29,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:12:29,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-23 01:12:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:29,237 INFO L225 Difference]: With dead ends: 41 [2018-11-23 01:12:29,237 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 01:12:29,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:12:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 01:12:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 01:12:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 01:12:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 01:12:29,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 13 [2018-11-23 01:12:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:29,242 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 01:12:29,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:12:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 01:12:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:12:29,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:29,243 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:29,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:29,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 1 times [2018-11-23 01:12:29,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:29,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:29,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-23 01:12:29,288 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [13], [37], [43], [45], [46], [50], [54], [55], [56], [57], [58], [59], [60], [62] [2018-11-23 01:12:29,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:12:29,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:12:29,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:12:29,340 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 times. Merged at 3 different actions 9 times. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 4. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 21 variables. [2018-11-23 01:12:29,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:29,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:12:29,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:29,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:29,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:29,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:29,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:29,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 01:12:29,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:12:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:12:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:12:29,436 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 7 states. [2018-11-23 01:12:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:29,453 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 01:12:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:12:29,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 01:12:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:29,455 INFO L225 Difference]: With dead ends: 46 [2018-11-23 01:12:29,455 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 01:12:29,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:12:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 01:12:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 01:12:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 01:12:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 01:12:29,458 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 24 [2018-11-23 01:12:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:29,458 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 01:12:29,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:12:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 01:12:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:12:29,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:29,459 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:29,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:29,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381224, now seen corresponding path program 2 times [2018-11-23 01:12:29,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:29,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:29,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:29,521 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:29,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:29,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:29,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:29,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:29,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 01:12:29,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:29,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:29,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2018-11-23 01:12:29,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 01:12:29,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 01:12:29,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:12:29,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:12:29,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-11-23 01:12:29,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 01:12:29,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-23 01:12:29,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:29,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 01:12:29,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:29,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 01:12:29,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2018-11-23 01:12:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 01:12:29,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 01:12:29,837 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:12:29,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 15 [2018-11-23 01:12:29,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:29,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:12:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:12:29,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:12:29,838 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2018-11-23 01:12:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:29,956 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 01:12:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:12:29,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 01:12:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:29,957 INFO L225 Difference]: With dead ends: 43 [2018-11-23 01:12:29,958 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 01:12:29,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 01:12:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 01:12:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 01:12:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 01:12:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 01:12:29,961 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 27 [2018-11-23 01:12:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:29,961 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 01:12:29,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:12:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 01:12:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:12:29,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:29,963 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:29,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:29,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381225, now seen corresponding path program 1 times [2018-11-23 01:12:29,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:29,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:29,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:29,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:30,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:30,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:30,004 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-23 01:12:30,004 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [14], [37], [43], [45], [46], [50], [54], [55], [56], [57], [58], [59], [60], [62] [2018-11-23 01:12:30,006 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:12:30,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:12:30,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:12:30,052 INFO L272 AbstractInterpreter]: Visited 18 different actions 37 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 233 root evaluator evaluations with a maximum evaluation depth of 4. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 21 variables. [2018-11-23 01:12:30,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:30,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:12:30,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:30,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:30,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:30,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:30,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:30,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 01:12:30,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:30,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:12:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:12:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:30,183 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 8 states. [2018-11-23 01:12:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:30,199 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 01:12:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:12:30,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 01:12:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:30,201 INFO L225 Difference]: With dead ends: 48 [2018-11-23 01:12:30,201 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 01:12:30,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 01:12:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 01:12:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 01:12:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 01:12:30,204 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-11-23 01:12:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:30,205 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 01:12:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:12:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 01:12:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 01:12:30,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:30,206 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:30,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:30,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 2 times [2018-11-23 01:12:30,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:30,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:30,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:30,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:30,260 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:30,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:30,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:30,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:30,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:30,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 01:12:30,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:30,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:30,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:12:30,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:30,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2018-11-23 01:12:30,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 01:12:30,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:12:30,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:12:30,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:12:30,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2018-11-23 01:12:30,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 36 [2018-11-23 01:12:30,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:30,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-23 01:12:30,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:30,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 24 [2018-11-23 01:12:30,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:30,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:12:30,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-23 01:12:30,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:30,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:12:30,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2018-11-23 01:12:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 01:12:30,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:30,669 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2018-11-23 01:12:32,258 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-23 01:12:32,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-23 01:12:32,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-11-23 01:12:32,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 01:12:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 01:12:32,500 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:12:32,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 18 [2018-11-23 01:12:32,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:32,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:12:32,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:12:32,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:12:32,501 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 7 states. [2018-11-23 01:12:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:32,684 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 01:12:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:12:32,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 01:12:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:32,685 INFO L225 Difference]: With dead ends: 46 [2018-11-23 01:12:32,685 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 01:12:32,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-23 01:12:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 01:12:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 01:12:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 01:12:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 01:12:32,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 30 [2018-11-23 01:12:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:32,689 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 01:12:32,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:12:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 01:12:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 01:12:32,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:32,689 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:32,690 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 978381594, now seen corresponding path program 1 times [2018-11-23 01:12:32,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 01:12:32,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:12:32,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:12:32,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:32,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:12:32,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:12:32,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:12:32,723 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-11-23 01:12:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:32,733 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 01:12:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:12:32,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 01:12:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:32,734 INFO L225 Difference]: With dead ends: 45 [2018-11-23 01:12:32,734 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 01:12:32,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:12:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 01:12:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 01:12:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 01:12:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 01:12:32,736 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 31 [2018-11-23 01:12:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:32,737 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 01:12:32,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:12:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 01:12:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 01:12:32,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:32,737 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:32,737 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:32,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash 978381595, now seen corresponding path program 1 times [2018-11-23 01:12:32,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:32,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:32,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-23 01:12:32,784 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [12], [17], [37], [43], [45], [46], [50], [54], [55], [56], [57], [58], [59], [60], [62] [2018-11-23 01:12:32,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:12:32,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:12:32,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:12:32,826 INFO L272 AbstractInterpreter]: Visited 19 different actions 38 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 241 root evaluator evaluations with a maximum evaluation depth of 4. Performed 241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 22 variables. [2018-11-23 01:12:32,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:32,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:12:32,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:32,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:32,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:32,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:32,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:32,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 01:12:32,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:32,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:12:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:12:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:32,949 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2018-11-23 01:12:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:32,966 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 01:12:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:12:32,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 01:12:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:32,967 INFO L225 Difference]: With dead ends: 50 [2018-11-23 01:12:32,967 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 01:12:32,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 01:12:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 01:12:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 01:12:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 01:12:32,969 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 31 [2018-11-23 01:12:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:32,969 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 01:12:32,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:12:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 01:12:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 01:12:32,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:32,970 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:32,970 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:32,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash 432910570, now seen corresponding path program 2 times [2018-11-23 01:12:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:32,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:32,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:32,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:12:33,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:33,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:33,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:33,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:33,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:33,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:33,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 01:12:33,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:33,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:33,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:12:33,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:12:33,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:12:33,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 01:12:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 01:12:33,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 01:12:33,122 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:12:33,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 13 [2018-11-23 01:12:33,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:12:33,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:12:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:12:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,123 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 4 states. [2018-11-23 01:12:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:33,136 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 01:12:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:12:33,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 01:12:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:33,136 INFO L225 Difference]: With dead ends: 47 [2018-11-23 01:12:33,136 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 01:12:33,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 01:12:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 01:12:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 01:12:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 01:12:33,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 34 [2018-11-23 01:12:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:33,139 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 01:12:33,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:12:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 01:12:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 01:12:33,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:33,140 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 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 01:12:33,140 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:33,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:33,141 INFO L82 PathProgramCache]: Analyzing trace with hash -408014623, now seen corresponding path program 1 times [2018-11-23 01:12:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:12:33,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:33,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-23 01:12:33,204 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [30], [32], [37], [43], [45], [46], [50], [54], [55], [56], [57], [58], [59], [60], [62], [63] [2018-11-23 01:12:33,205 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:12:33,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:12:33,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:12:33,267 INFO L272 AbstractInterpreter]: Visited 27 different actions 66 times. Merged at 11 different actions 32 times. Widened at 1 different actions 1 times. Performed 388 root evaluator evaluations with a maximum evaluation depth of 4. Performed 388 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-23 01:12:33,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:33,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:12:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:33,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:33,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:33,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:12:33,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:12:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:33,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 01:12:33,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:33,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:12:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:12:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,415 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2018-11-23 01:12:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:33,436 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 01:12:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:12:33,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-11-23 01:12:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:33,437 INFO L225 Difference]: With dead ends: 52 [2018-11-23 01:12:33,437 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 01:12:33,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 01:12:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 01:12:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 01:12:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 01:12:33,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 42 [2018-11-23 01:12:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:33,443 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 01:12:33,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:12:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 01:12:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 01:12:33,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:33,444 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 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 01:12:33,444 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:33,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1348926542, now seen corresponding path program 2 times [2018-11-23 01:12:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:12:33,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:33,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:33,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:33,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:33,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:33,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 01:12:33,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:33,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 01:12:33,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 01:12:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:33,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2018-11-23 01:12:33,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:33,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:12:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:12:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:12:33,611 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 12 states. [2018-11-23 01:12:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:33,680 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 01:12:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:12:33,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 01:12:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:33,681 INFO L225 Difference]: With dead ends: 64 [2018-11-23 01:12:33,681 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 01:12:33,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:12:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 01:12:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-11-23 01:12:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 01:12:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-23 01:12:33,685 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 45 [2018-11-23 01:12:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:33,685 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-23 01:12:33,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:12:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 01:12:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:12:33,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:33,686 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:33,686 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:33,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1432258301, now seen corresponding path program 3 times [2018-11-23 01:12:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:33,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:33,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:33,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:33,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:33,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:33,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:12:33,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:12:33,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:12:33,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:33,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:33,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:33,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 01:12:33,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:33,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:12:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:12:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,894 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 12 states. [2018-11-23 01:12:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:33,920 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 01:12:33,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:12:33,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 01:12:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:33,927 INFO L225 Difference]: With dead ends: 63 [2018-11-23 01:12:33,927 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 01:12:33,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 01:12:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 01:12:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 01:12:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 01:12:33,930 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 53 [2018-11-23 01:12:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:33,930 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 01:12:33,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:12:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 01:12:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 01:12:33,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:33,935 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:33,935 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:33,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1491367820, now seen corresponding path program 4 times [2018-11-23 01:12:33,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:33,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:34,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,026 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:34,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:34,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 01:12:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 01:12:34,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:34,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:12:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:12:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,123 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 13 states. [2018-11-23 01:12:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:34,145 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 01:12:34,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:12:34,146 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-23 01:12:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:34,147 INFO L225 Difference]: With dead ends: 64 [2018-11-23 01:12:34,147 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 01:12:34,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 01:12:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 01:12:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 01:12:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 01:12:34,150 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 56 [2018-11-23 01:12:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:34,150 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 01:12:34,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:12:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 01:12:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 01:12:34,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:34,151 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:34,151 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:34,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 5 times [2018-11-23 01:12:34,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:34,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:34,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,202 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:34,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:34,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 01:12:34,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:34,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 01:12:34,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:34,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:12:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:12:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:12:34,269 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2018-11-23 01:12:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:34,288 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 01:12:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:12:34,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-23 01:12:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:34,289 INFO L225 Difference]: With dead ends: 73 [2018-11-23 01:12:34,289 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 01:12:34,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:12:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 01:12:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-23 01:12:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 01:12:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 01:12:34,292 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2018-11-23 01:12:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:34,292 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 01:12:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:12:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 01:12:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 01:12:34,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:34,296 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:34,296 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:34,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 6 times [2018-11-23 01:12:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:12:34,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:12:34,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:12:34,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:34,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 01:12:34,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:34,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:12:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:12:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:12:34,475 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2018-11-23 01:12:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:34,488 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 01:12:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:12:34,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-23 01:12:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:34,489 INFO L225 Difference]: With dead ends: 78 [2018-11-23 01:12:34,489 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 01:12:34,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:12:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 01:12:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-11-23 01:12:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 01:12:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-23 01:12:34,492 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2018-11-23 01:12:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:34,493 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-23 01:12:34,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:12:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 01:12:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 01:12:34,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:34,494 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:34,494 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:34,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 7 times [2018-11-23 01:12:34,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,539 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:34,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:34,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 01:12:34,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:34,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:12:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:12:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,626 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 8 states. [2018-11-23 01:12:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:34,645 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-11-23 01:12:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:12:34,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-11-23 01:12:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:34,646 INFO L225 Difference]: With dead ends: 83 [2018-11-23 01:12:34,646 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 01:12:34,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 01:12:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-23 01:12:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 01:12:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-23 01:12:34,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-11-23 01:12:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:34,649 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-23 01:12:34,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:12:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-23 01:12:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 01:12:34,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:34,650 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:34,650 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:34,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 8 times [2018-11-23 01:12:34,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,715 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:34,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:34,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 01:12:34,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:34,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 01:12:34,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:34,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:12:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:12:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,891 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2018-11-23 01:12:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:34,915 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-23 01:12:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:12:34,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-11-23 01:12:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:34,916 INFO L225 Difference]: With dead ends: 88 [2018-11-23 01:12:34,916 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 01:12:34,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 01:12:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-11-23 01:12:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 01:12:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-23 01:12:34,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2018-11-23 01:12:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:34,921 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-23 01:12:34,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:12:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-23 01:12:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 01:12:34,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:34,923 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:34,923 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:34,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 9 times [2018-11-23 01:12:34,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:34,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:34,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:34,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:34,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:34,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:34,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:34,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:12:34,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:12:35,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:12:35,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:35,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:35,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 01:12:35,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:35,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:12:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:12:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,223 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2018-11-23 01:12:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:35,263 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-23 01:12:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:12:35,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-23 01:12:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:35,264 INFO L225 Difference]: With dead ends: 93 [2018-11-23 01:12:35,265 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 01:12:35,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 01:12:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-11-23 01:12:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 01:12:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-23 01:12:35,267 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2018-11-23 01:12:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:35,267 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-23 01:12:35,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:12:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-23 01:12:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 01:12:35,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:35,268 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:35,268 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:35,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 10 times [2018-11-23 01:12:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:35,342 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:35,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:35,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:35,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:12:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:35,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:35,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-23 01:12:35,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:35,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:12:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:12:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,454 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2018-11-23 01:12:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:35,485 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-23 01:12:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:12:35,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-11-23 01:12:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:35,486 INFO L225 Difference]: With dead ends: 98 [2018-11-23 01:12:35,486 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 01:12:35,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 01:12:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-11-23 01:12:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 01:12:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-23 01:12:35,488 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-11-23 01:12:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:35,489 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-23 01:12:35,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:12:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-23 01:12:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 01:12:35,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:35,490 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:35,490 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:35,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 11 times [2018-11-23 01:12:35,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:35,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:12:35,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:35,550 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:35,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:12:35,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:12:35,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 01:12:35,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:35,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:35,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 01:12:35,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:35,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:12:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:12:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,750 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-11-23 01:12:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:35,776 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-11-23 01:12:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:12:35,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-11-23 01:12:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:35,777 INFO L225 Difference]: With dead ends: 103 [2018-11-23 01:12:35,777 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 01:12:35,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 169 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 01:12:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 01:12:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 01:12:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-23 01:12:35,779 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2018-11-23 01:12:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-23 01:12:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:12:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-23 01:12:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 01:12:35,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:35,781 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:35,781 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 12 times [2018-11-23 01:12:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:35,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:12:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:35,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:12:35,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:12:35,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:12:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:12:35,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:12:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 01:12:35,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 01:12:36,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 01:12:36,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:12:36,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:12:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:36,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:12:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 01:12:36,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:12:36,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 01:12:36,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:12:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:12:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:12:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:36,100 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2018-11-23 01:12:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:12:36,132 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-11-23 01:12:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:12:36,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 01:12:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:12:36,132 INFO L225 Difference]: With dead ends: 104 [2018-11-23 01:12:36,132 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 01:12:36,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:12:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 01:12:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 01:12:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 01:12:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-23 01:12:36,135 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2018-11-23 01:12:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:12:36,136 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-23 01:12:36,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:12:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-23 01:12:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 01:12:36,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:12:36,137 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:12:36,137 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 01:12:36,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:12:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 13 times [2018-11-23 01:12:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:12:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:36,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:12:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:12:36,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:12:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:12:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:12:36,259 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=44, |~#array~0.offset|=45] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #59#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~i~0 := 0; VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #57#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~ret1.base|=42, |getNumbers2_#t~ret1.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40);~i~1 := 0; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~1 < 10); VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset;call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset);havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4.base|=46, |main_#t~ret4.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(1 == #valid[~numbers~1.base]); VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- [2018-11-23 01:12:36,557 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-23 01:12:36,558 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 ----- [2018-11-23 01:12:36,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:36 BoogieIcfgContainer [2018-11-23 01:12:36,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:12:36,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:12:36,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:12:36,698 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:12:36,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:28" (3/4) ... [2018-11-23 01:12:36,712 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=44, |~#array~0.offset|=45] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #59#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~i~0 := 0; VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #57#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~ret1.base|=42, |getNumbers2_#t~ret1.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40);~i~1 := 0; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~1 < 10); VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset;call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset);havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4.base|=46, |main_#t~ret4.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(1 == #valid[~numbers~1.base]); VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- [2018-11-23 01:12:37,364 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-23 01:12:37,364 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] FCALL call write~int(~i~0, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 ----- [2018-11-23 01:12:37,588 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_176f212e-4a5a-48fa-a210-6d6eb6df03b2/bin-2019/utaipan/witness.graphml [2018-11-23 01:12:37,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:12:37,588 INFO L168 Benchmark]: Toolchain (without parser) took 9932.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 961.2 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,589 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:12:37,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.50 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.01 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,591 INFO L168 Benchmark]: Boogie Preprocessor took 59.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,592 INFO L168 Benchmark]: RCFGBuilder took 221.36 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,592 INFO L168 Benchmark]: TraceAbstraction took 8592.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,592 INFO L168 Benchmark]: Witness Printer took 890.02 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:12:37,594 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.50 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.01 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.36 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8592.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 890.02 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. UNSAFE Result, 8.5s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 594 SDtfs, 465 SDslu, 2421 SDs, 0 SdLazy, 856 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2150 GetRequests, 1870 SyntacticMatches, 60 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 46 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2138 NumberOfCodeBlocks, 2028 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2973 ConstructedInterpolants, 20 QuantifiedInterpolants, 401974 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3579 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 60 InterpolantComputations, 9 PerfectInterpolantSequences, 3918/7022 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...