./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:57,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:57,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:57,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:57,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:57,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:57,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:57,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:57,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:57,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:57,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:57,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:57,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:57,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:57,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:57,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:57,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:57,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:57,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:57,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:57,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:57,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:57,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:57,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:57,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:57,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:57,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:57,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:57,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:57,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:57,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:57,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:57,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:57,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:57,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:57,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:57,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:57,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:57,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:57,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:57,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:57,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:57,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:57,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:57,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:57,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:57,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:57,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:57,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:57,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:57,365 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:57,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:57,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:57,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:57,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:57,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:57,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:57,367 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:57,367 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:57,368 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:57,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:57,368 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:57,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:57,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:57,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:57,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:57,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:57,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:57,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:57,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:57,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:57,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:57,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2022-02-21 00:02:57,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:57,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:57,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:57,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:57,620 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:57,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-02-21 00:02:57,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15fa763d9/7887ebd75cd94d929be0a3d4a8ecfd99/FLAG7bb97686b [2022-02-21 00:02:58,035 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:58,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-02-21 00:02:58,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15fa763d9/7887ebd75cd94d929be0a3d4a8ecfd99/FLAG7bb97686b [2022-02-21 00:02:58,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15fa763d9/7887ebd75cd94d929be0a3d4a8ecfd99 [2022-02-21 00:02:58,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:58,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:58,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:58,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:58,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:58,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102a5c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58, skipping insertion in model container [2022-02-21 00:02:58,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:58,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:58,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:58,291 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:58,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:58,347 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:58,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58 WrapperNode [2022-02-21 00:02:58,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:58,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:58,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:58,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:58,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,402 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2022-02-21 00:02:58,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:58,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:58,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:58,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:58,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:58,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:58,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:58,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:58,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (1/1) ... [2022-02-21 00:02:58,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:58,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 00:02:58,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 00:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 00:02:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:02:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:58,571 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:58,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:58,890 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:58,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:58,899 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-21 00:02:58,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:58 BoogieIcfgContainer [2022-02-21 00:02:58,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:58,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:58,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:58,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:58,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:58" (1/3) ... [2022-02-21 00:02:58,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3b8eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:58, skipping insertion in model container [2022-02-21 00:02:58,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:58" (2/3) ... [2022-02-21 00:02:58,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3b8eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:58, skipping insertion in model container [2022-02-21 00:02:58,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:58" (3/3) ... [2022-02-21 00:02:58,909 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2022-02-21 00:02:58,914 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:58,914 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-21 00:02:58,950 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:58,955 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 00:02:58,955 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-02-21 00:02:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:58,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:58,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:58,984 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:02:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 00:02:58,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:58,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296104117] [2022-02-21 00:02:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} is VALID [2022-02-21 00:02:59,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} is VALID [2022-02-21 00:02:59,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} assume !!(getNumbers_~i~0#1 < 10); {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} is VALID [2022-02-21 00:02:59,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#(and (= (select |#valid| |~#array~0.base|) 1) (= 2 |~#array~0.base|))} assume !(1 == #valid[~#array~0.base]); {57#false} is VALID [2022-02-21 00:02:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:59,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:59,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296104117] [2022-02-21 00:02:59,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296104117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:59,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:59,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 00:02:59,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921021827] [2022-02-21 00:02:59,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:59,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:59,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:59,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:59,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:59,277 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,405 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-02-21 00:02:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:59,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 00:02:59,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:59,505 INFO L225 Difference]: With dead ends: 52 [2022-02-21 00:02:59,505 INFO L226 Difference]: Without dead ends: 50 [2022-02-21 00:02:59,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:59,509 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:59,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-21 00:02:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-21 00:02:59,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:59,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,531 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,532 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,536 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-02-21 00:02:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-21 00:02:59,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-21 00:02:59,538 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-21 00:02:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,541 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-02-21 00:02:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-21 00:02:59,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:59,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-02-21 00:02:59,545 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2022-02-21 00:02:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:59,545 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-02-21 00:02:59,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-21 00:02:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:59,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:59,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:59,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:59,547 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:02:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-21 00:02:59,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:59,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617908759] [2022-02-21 00:02:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {265#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:02:59,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {266#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:02:59,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume !!(getNumbers_~i~0#1 < 10); {266#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:02:59,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume !(4 + (~#array~0.offset + 4 * getNumbers_~i~0#1) <= #length[~#array~0.base] && 0 <= ~#array~0.offset + 4 * getNumbers_~i~0#1); {264#false} is VALID [2022-02-21 00:02:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:59,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:59,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617908759] [2022-02-21 00:02:59,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617908759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:59,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:59,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:59,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073412304] [2022-02-21 00:02:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:59,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:59,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:59,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:02:59,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:02:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:02:59,701 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,883 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-21 00:02:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:02:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-21 00:02:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-21 00:02:59,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-02-21 00:02:59,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:59,948 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:59,948 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 00:02:59,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:02:59,950 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 55 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:59,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 00:02:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-02-21 00:02:59,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:59,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,957 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,959 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,962 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-21 00:02:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-21 00:02:59,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-21 00:02:59,963 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-21 00:02:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,965 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-02-21 00:02:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-21 00:02:59,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:59,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-21 00:02:59,968 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2022-02-21 00:02:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:59,968 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-21 00:02:59,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-21 00:02:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:02:59,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:59,969 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-02-21 00:02:59,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:59,969 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:02:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2022-02-21 00:02:59,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:59,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821954033] [2022-02-21 00:02:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {482#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume !!(getNumbers_~i~0#1 < 10); {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {484#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume !!(getNumbers_~i~0#1 < 10); {485#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers_~i~0#1| 9) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:03:00,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers_~i~0#1| 9) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} assume !(4 + (~#array~0.offset + 4 * getNumbers_~i~0#1) <= #length[~#array~0.base] && 0 <= ~#array~0.offset + 4 * getNumbers_~i~0#1); {481#false} is VALID [2022-02-21 00:03:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:00,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:00,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821954033] [2022-02-21 00:03:00,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821954033] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:00,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376984262] [2022-02-21 00:03:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:00,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 00:03:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:03:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:00,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {489#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {493#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {503#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {503#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {503#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:00,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {503#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !(4 + (~#array~0.offset + 4 * getNumbers_~i~0#1) <= #length[~#array~0.base] && 0 <= ~#array~0.offset + 4 * getNumbers_~i~0#1); {481#false} is VALID [2022-02-21 00:03:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:00,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:00,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4) (select |#length| |~#array~0.base|)))} assume !(4 + (~#array~0.offset + 4 * getNumbers_~i~0#1) <= #length[~#array~0.base] && 0 <= ~#array~0.offset + 4 * getNumbers_~i~0#1); {481#false} is VALID [2022-02-21 00:03:00,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {510#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {510#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:00,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {510#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:00,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} is VALID [2022-02-21 00:03:00,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} assume !!(getNumbers_~i~0#1 < 10); {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} is VALID [2022-02-21 00:03:00,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {517#(and (<= (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 8) (select |#length| |~#array~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers_~i~0#1| 4) |~#array~0.offset| 4)))} is VALID [2022-02-21 00:03:00,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {527#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:00,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376984262] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:00,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:00,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-02-21 00:03:00,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105632554] [2022-02-21 00:03:00,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:00,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:00,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:00,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:00,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 00:03:00,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:00,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 00:03:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-21 00:03:00,602 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:01,265 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-02-21 00:03:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:03:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-02-21 00:03:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-02-21 00:03:01,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2022-02-21 00:03:01,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:01,333 INFO L225 Difference]: With dead ends: 59 [2022-02-21 00:03:01,333 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 00:03:01,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-02-21 00:03:01,334 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 166 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:01,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 219 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:03:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 00:03:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-21 00:03:01,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:01,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,338 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,339 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:01,341 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-02-21 00:03:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-21 00:03:01,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:01,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:01,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 00:03:01,342 INFO L87 Difference]: Start difference. First operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 00:03:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:01,344 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-02-21 00:03:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-21 00:03:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:01,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:01,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:01,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-21 00:03:01,350 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2022-02-21 00:03:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:01,350 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-21 00:03:01,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-21 00:03:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:03:01,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:01,351 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:01,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:01,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:01,572 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2022-02-21 00:03:01,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:01,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99321160] [2022-02-21 00:03:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:01,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {778#true} is VALID [2022-02-21 00:03:01,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {780#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {784#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:03:01,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !(getNumbers_~i~0#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {779#false} is VALID [2022-02-21 00:03:01,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {779#false} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {779#false} is VALID [2022-02-21 00:03:01,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#false} assume !!(getNumbers2_~i~1#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#false} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {779#false} is VALID [2022-02-21 00:03:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:01,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:01,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99321160] [2022-02-21 00:03:01,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99321160] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:01,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175824942] [2022-02-21 00:03:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:01,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:01,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:01,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 00:03:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:01,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 00:03:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:01,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:01,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {778#true} is VALID [2022-02-21 00:03:01,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:03:01,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {791#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:03:01,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:03:01,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:03:01,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {784#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:03:01,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !(getNumbers_~i~0#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {779#false} is VALID [2022-02-21 00:03:01,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {779#false} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {779#false} is VALID [2022-02-21 00:03:01,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#false} assume !!(getNumbers2_~i~1#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#false} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {779#false} is VALID [2022-02-21 00:03:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:01,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:01,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#false} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {779#false} is VALID [2022-02-21 00:03:01,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#false} assume !!(getNumbers2_~i~1#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {779#false} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {779#false} is VALID [2022-02-21 00:03:01,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {779#false} is VALID [2022-02-21 00:03:01,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} assume !(getNumbers_~i~0#1 < 10); {779#false} is VALID [2022-02-21 00:03:01,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {855#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} is VALID [2022-02-21 00:03:01,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:03:01,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} assume !!(getNumbers_~i~0#1 < 10); {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:03:01,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {859#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:03:01,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:03:01,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} assume !!(getNumbers_~i~0#1 < 10); {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:03:01,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {869#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:03:01,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:03:01,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} assume !!(getNumbers_~i~0#1 < 10); {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:03:01,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {879#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:03:01,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:03:01,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} assume !!(getNumbers_~i~0#1 < 10); {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:03:01,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {889#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:03:01,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {778#true} is VALID [2022-02-21 00:03:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:01,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175824942] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:01,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:01,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 00:03:01,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474674214] [2022-02-21 00:03:01,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:03:01,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:01,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:02,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:03:02,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:03:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:02,033 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,202 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:02,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:03:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-02-21 00:03:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-02-21 00:03:02,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2022-02-21 00:03:02,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:02,285 INFO L225 Difference]: With dead ends: 77 [2022-02-21 00:03:02,285 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 00:03:02,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:02,286 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:02,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 00:03:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 00:03:02,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:02,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,291 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,291 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,293 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:02,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:02,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:02,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 00:03:02,294 INFO L87 Difference]: Start difference. First operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 00:03:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,296 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:02,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:02,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:02,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:02,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-02-21 00:03:02,298 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2022-02-21 00:03:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:02,299 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-02-21 00:03:02,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:03:02,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:02,299 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:02,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:02,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-21 00:03:02,526 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2022-02-21 00:03:02,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:02,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498135348] [2022-02-21 00:03:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:02,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {1209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {1211#(= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:02,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#(= |~#array~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {1212#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {1215#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1216#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1217#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {1218#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1219#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:02,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {1220#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1221#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {1221#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {1221#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:02,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {1221#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:02,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:02,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} assume !(getNumbers_~i~0#1 < 10); {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:02,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1223#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} is VALID [2022-02-21 00:03:02,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {1223#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {1224#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:02,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {1224#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {1224#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:02,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {1224#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {1210#false} is VALID [2022-02-21 00:03:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:02,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:02,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498135348] [2022-02-21 00:03:02,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498135348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:02,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440051581] [2022-02-21 00:03:02,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:02,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:02,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:02,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 00:03:02,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 00:03:02,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:02,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 00:03:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:02,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:03,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {1209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !(getNumbers_~i~0#1 < 10); {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {1228#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1328#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {1328#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {1332#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {1332#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {1332#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:03,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {1332#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {1210#false} is VALID [2022-02-21 00:03:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:03,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:03:03,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440051581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:03,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:03:03,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 17 [2022-02-21 00:03:03,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129796994] [2022-02-21 00:03:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-21 00:03:03,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:03,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:03,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:03:03,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:03:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:03:03,449 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:03,626 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-21 00:03:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:03:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-21 00:03:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-21 00:03:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-21 00:03:03,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-21 00:03:03,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:03,714 INFO L225 Difference]: With dead ends: 85 [2022-02-21 00:03:03,714 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 00:03:03,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-02-21 00:03:03,715 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:03,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 64 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 00:03:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-02-21 00:03:03,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:03,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,720 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,720 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:03,723 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-21 00:03:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-21 00:03:03,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:03,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:03,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-21 00:03:03,724 INFO L87 Difference]: Start difference. First operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-21 00:03:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:03,726 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-21 00:03:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-21 00:03:03,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:03,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:03,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:03,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-02-21 00:03:03,729 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2022-02-21 00:03:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:03,730 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-02-21 00:03:03,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-02-21 00:03:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:03:03,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:03,731 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:03,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:03,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:03,954 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2022-02-21 00:03:03,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:03,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059132313] [2022-02-21 00:03:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:04,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {1676#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {1676#true} is VALID [2022-02-21 00:03:04,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {1676#true} is VALID [2022-02-21 00:03:04,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume !!(getNumbers_~i~0#1 < 10); {1676#true} is VALID [2022-02-21 00:03:04,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {1676#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !!(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} assume !(getNumbers_~i~0#1 < 10); {1678#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2022-02-21 00:03:04,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {1678#(= (select |#valid| |~#array~0.base|) 1)} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1679#(= (select |#valid| |ULTIMATE.start_getNumbers_#res#1.base|) 1)} is VALID [2022-02-21 00:03:04,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {1679#(= (select |#valid| |ULTIMATE.start_getNumbers_#res#1.base|) 1)} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {1680#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} is VALID [2022-02-21 00:03:04,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} assume !!(getNumbers2_~i~1#1 < 10); {1680#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} is VALID [2022-02-21 00:03:04,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} assume !(1 == #valid[getNumbers2_~numbers~0#1.base]); {1677#false} is VALID [2022-02-21 00:03:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-21 00:03:04,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:04,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059132313] [2022-02-21 00:03:04,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059132313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:04,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:04,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:03:04,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165294733] [2022-02-21 00:03:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-21 00:03:04,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:04,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:03:04,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:03:04,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:03:04,055 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,182 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-02-21 00:03:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:03:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-21 00:03:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-21 00:03:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-21 00:03:04,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-21 00:03:04,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,228 INFO L225 Difference]: With dead ends: 78 [2022-02-21 00:03:04,228 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 00:03:04,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:03:04,228 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:04,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 00:03:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-21 00:03:04,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:04,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,232 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,233 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,234 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-02-21 00:03:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-02-21 00:03:04,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-21 00:03:04,235 INFO L87 Difference]: Start difference. First operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-21 00:03:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,237 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-02-21 00:03:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-02-21 00:03:04,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:04,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-02-21 00:03:04,239 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2022-02-21 00:03:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:04,240 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-02-21 00:03:04,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-02-21 00:03:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:03:04,241 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:04,241 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:04,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:03:04,241 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2022-02-21 00:03:04,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:04,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219791257] [2022-02-21 00:03:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:04,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {1999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !(getNumbers_~i~0#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} is VALID [2022-02-21 00:03:04,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {2001#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= (select |#valid| 3) (select |#valid| |~#numbers2~0.base|)))} assume !(1 == #valid[~#numbers2~0.base]); {2000#false} is VALID [2022-02-21 00:03:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:04,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:04,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219791257] [2022-02-21 00:03:04,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219791257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:04,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:04,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 00:03:04,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957312569] [2022-02-21 00:03:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-21 00:03:04,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:04,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:04,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:04,349 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,411 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-21 00:03:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-02-21 00:03:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-02-21 00:03:04,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-02-21 00:03:04,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,450 INFO L225 Difference]: With dead ends: 77 [2022-02-21 00:03:04,450 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 00:03:04,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:04,451 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:04,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 00:03:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 00:03:04,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:04,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,455 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,455 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,457 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:04,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 00:03:04,457 INFO L87 Difference]: Start difference. First operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 00:03:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,459 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-21 00:03:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:04,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:04,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-02-21 00:03:04,461 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2022-02-21 00:03:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:04,461 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-02-21 00:03:04,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-21 00:03:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:03:04,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:04,462 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:04,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:03:04,462 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2022-02-21 00:03:04,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:04,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613629540] [2022-02-21 00:03:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:04,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {2312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !(getNumbers_~i~0#1 < 10); {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {2314#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:04,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {2315#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {2313#false} is VALID [2022-02-21 00:03:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:04,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:04,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613629540] [2022-02-21 00:03:04,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613629540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:04,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:04,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:04,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653518671] [2022-02-21 00:03:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:04,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-21 00:03:04,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:04,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:03:04,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:03:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:03:04,591 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,693 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-21 00:03:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:03:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-21 00:03:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-21 00:03:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-21 00:03:04,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-21 00:03:04,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,745 INFO L225 Difference]: With dead ends: 80 [2022-02-21 00:03:04,745 INFO L226 Difference]: Without dead ends: 80 [2022-02-21 00:03:04,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:03:04,746 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:04,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-21 00:03:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-02-21 00:03:04,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:04,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,750 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,750 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,752 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-21 00:03:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-02-21 00:03:04,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-21 00:03:04,753 INFO L87 Difference]: Start difference. First operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-21 00:03:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:04,760 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-21 00:03:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-02-21 00:03:04,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:04,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:04,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:04,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-02-21 00:03:04,763 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2022-02-21 00:03:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:04,763 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-02-21 00:03:04,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-02-21 00:03:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 00:03:04,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:04,763 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:04,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:03:04,764 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2022-02-21 00:03:04,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:04,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828481427] [2022-02-21 00:03:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:05,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {2636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {2638#(= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:05,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {2638#(= |~#array~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {2639#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {2641#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {2642#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {2643#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {2645#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {2646#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:05,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {2647#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2648#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {2648#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {2648#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:05,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {2648#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:05,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:05,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} assume !(getNumbers_~i~0#1 < 10); {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:05,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {2649#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2650#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} is VALID [2022-02-21 00:03:05,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {2650#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:05,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:05,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:05,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:05,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:05,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {2651#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {2652#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:05,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {2652#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {2652#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:05,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {2652#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {2637#false} is VALID [2022-02-21 00:03:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 100 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:05,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:05,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828481427] [2022-02-21 00:03:05,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828481427] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:05,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113617069] [2022-02-21 00:03:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:05,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:05,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:05,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 00:03:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:05,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 00:03:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:05,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:05,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {2636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !(getNumbers_~i~0#1 < 10); {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {2656#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2756#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {2756#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {2760#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {2776#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {2776#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {2776#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:05,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {2776#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {2637#false} is VALID [2022-02-21 00:03:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:05,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:06,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {2783#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {2637#false} is VALID [2022-02-21 00:03:06,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {2783#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} assume !!(getNumbers2_~i~1#1 < 10); {2783#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} is VALID [2022-02-21 00:03:06,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {2783#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} is VALID [2022-02-21 00:03:06,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:06,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:06,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:06,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:06,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {2806#(and (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 8) (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)) (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 4)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {2790#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:06,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2806#(and (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 8) (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)) (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 4)))} is VALID [2022-02-21 00:03:06,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {2636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {2810#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:06,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113617069] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:06,315 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:06,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 4] total 23 [2022-02-21 00:03:06,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509604118] [2022-02-21 00:03:06,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-21 00:03:06,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:06,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:06,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:06,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-21 00:03:06,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 00:03:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-02-21 00:03:06,375 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:07,403 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-21 00:03:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 00:03:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-21 00:03:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2022-02-21 00:03:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2022-02-21 00:03:07,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 107 transitions. [2022-02-21 00:03:07,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:07,499 INFO L225 Difference]: With dead ends: 98 [2022-02-21 00:03:07,499 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 00:03:07,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2022-02-21 00:03:07,500 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 416 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:07,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 109 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 00:03:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 00:03:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2022-02-21 00:03:07,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:07,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,504 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,505 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:07,507 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-21 00:03:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-02-21 00:03:07,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:07,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:07,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-21 00:03:07,508 INFO L87 Difference]: Start difference. First operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-21 00:03:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:07,512 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-21 00:03:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-02-21 00:03:07,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:07,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:07,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:07,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-02-21 00:03:07,514 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2022-02-21 00:03:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:07,514 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-02-21 00:03:07,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-02-21 00:03:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 00:03:07,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:07,515 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:07,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-21 00:03:07,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:07,731 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2022-02-21 00:03:07,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:07,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57719390] [2022-02-21 00:03:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:07,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {3325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !(getNumbers_~i~0#1 < 10); {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {3327#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} havoc getNumbers2_#t~mem3#1; {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {3328#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:07,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {3329#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {3326#false} is VALID [2022-02-21 00:03:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:07,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:07,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57719390] [2022-02-21 00:03:07,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57719390] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:07,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242485455] [2022-02-21 00:03:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:07,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:07,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:07,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:07,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 00:03:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:03:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:07,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:08,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {3325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {3333#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {3436#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:08,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {3452#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {3326#false} is VALID [2022-02-21 00:03:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:08,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:08,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {3326#false} is VALID [2022-02-21 00:03:08,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} assume !!(getNumbers2_~i~1#1 < 10); {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3462#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} havoc getNumbers2_#t~mem3#1; {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} assume !!(getNumbers2_~i~1#1 < 10); {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {3472#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {3325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {3488#(and (<= (+ 8 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ 4 |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:08,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242485455] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:08,907 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:08,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-02-21 00:03:08,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039018821] [2022-02-21 00:03:08,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-21 00:03:08,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:08,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:08,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:08,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 00:03:08,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 00:03:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-21 00:03:08,945 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,294 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-21 00:03:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 00:03:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-21 00:03:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-21 00:03:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-21 00:03:09,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-02-21 00:03:09,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,352 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:03:09,352 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:03:09,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-02-21 00:03:09,353 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 126 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 119 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:03:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-21 00:03:09,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,357 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,357 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,358 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-21 00:03:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-21 00:03:09,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2022-02-21 00:03:09,359 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2022-02-21 00:03:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,367 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-21 00:03:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-21 00:03:09,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-02-21 00:03:09,369 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2022-02-21 00:03:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,369 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-02-21 00:03:09,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-21 00:03:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 00:03:09,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,370 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:09,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:09,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 00:03:09,583 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2022-02-21 00:03:09,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754664398] [2022-02-21 00:03:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3972#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {3974#(= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:09,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3974#(= |~#array~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {3975#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {3976#(and (<= 1 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {3977#(and (= |~#array~0.offset| 0) (<= 2 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {3978#(and (<= 3 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {3979#(and (= |~#array~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {3980#(and (= |~#array~0.offset| 0) (<= 5 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {3981#(and (= |~#array~0.offset| 0) (<= 6 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {3982#(and (<= 7 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} assume !!(getNumbers_~i~0#1 < 10); {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} is VALID [2022-02-21 00:03:09,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {3983#(and (= |~#array~0.offset| 0) (<= 8 |ULTIMATE.start_getNumbers_~i~0#1|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3984#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {3984#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {3984#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:09,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {3984#(and (<= 9 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:09,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:09,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} assume !(getNumbers_~i~0#1 < 10); {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:03:09,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {3985#(and (= |~#array~0.offset| 0) (<= (+ 40 |~#array~0.offset|) (select |#length| |~#array~0.base|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3986#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} is VALID [2022-02-21 00:03:09,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {3987#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} havoc getNumbers2_#t~mem3#1; {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {3988#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 36) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} havoc getNumbers2_#t~mem3#1; {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {3989#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 32) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} havoc getNumbers2_#t~mem3#1; {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:09,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {3990#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 28) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3991#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {3991#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {3991#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:09,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {3991#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 24) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {3973#false} is VALID [2022-02-21 00:03:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754664398] [2022-02-21 00:03:09,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754664398] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:09,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317379025] [2022-02-21 00:03:09,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:09,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:09,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:09,949 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 00:03:10,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:03:10,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:10,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 00:03:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:10,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:10,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {3972#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} assume !(getNumbers_~i~0#1 < 10); {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {3995#(and (= |~#array~0.offset| 0) (= 2 |~#array~0.base|) (<= 40 (select |#length| 2)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4095#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {4095#(and (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {4099#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {4115#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {4131#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 1) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {4147#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4163#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {4163#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {4163#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:10,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {4163#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 40 (select |#length| 2)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {3973#false} is VALID [2022-02-21 00:03:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:10,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:11,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {4170#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {3973#false} is VALID [2022-02-21 00:03:11,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {4170#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} assume !!(getNumbers2_~i~1#1 < 10); {4170#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} is VALID [2022-02-21 00:03:11,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4170#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)))} is VALID [2022-02-21 00:03:11,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4177#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4193#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4209#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 12)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {4241#(and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 16)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {4225#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 16 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)))} is VALID [2022-02-21 00:03:11,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4241#(and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 16)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 20) (select |#length| |ULTIMATE.start_getNumbers_#res#1.base|)))} is VALID [2022-02-21 00:03:11,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume !!(getNumbers_~i~0#1 < 10); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {3972#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {4245#(and (<= (+ |~#array~0.offset| 20) (select |#length| |~#array~0.base|)) (<= 0 (+ 16 |~#array~0.offset|)))} is VALID [2022-02-21 00:03:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:11,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317379025] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:11,550 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:11,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2022-02-21 00:03:11,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707513606] [2022-02-21 00:03:11,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 00:03:11,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:11,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:11,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:11,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-21 00:03:11,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:11,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-21 00:03:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2022-02-21 00:03:11,655 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:13,889 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-21 00:03:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 00:03:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 00:03:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 152 transitions. [2022-02-21 00:03:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 152 transitions. [2022-02-21 00:03:13,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 152 transitions. [2022-02-21 00:03:14,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:14,045 INFO L225 Difference]: With dead ends: 137 [2022-02-21 00:03:14,045 INFO L226 Difference]: Without dead ends: 137 [2022-02-21 00:03:14,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2022-02-21 00:03:14,047 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 774 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:14,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 270 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 00:03:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-21 00:03:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2022-02-21 00:03:14,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:14,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:14,051 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:14,051 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:14,053 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-21 00:03:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2022-02-21 00:03:14,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:14,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:14,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-21 00:03:14,054 INFO L87 Difference]: Start difference. First operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-21 00:03:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:14,057 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-21 00:03:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2022-02-21 00:03:14,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:14,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:14,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:14,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2022-02-21 00:03:14,059 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2022-02-21 00:03:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:14,060 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2022-02-21 00:03:14,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-02-21 00:03:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 00:03:14,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:14,061 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:14,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:14,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:14,275 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2022-02-21 00:03:14,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:14,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40039936] [2022-02-21 00:03:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:14,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {4919#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !(getNumbers_~i~0#1 < 10); {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {4921#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} havoc getNumbers2_#t~mem3#1; {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {4922#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} havoc getNumbers2_#t~mem3#1; {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {4923#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} havoc getNumbers2_#t~mem3#1; {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {4924#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} havoc getNumbers2_#t~mem3#1; {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} is VALID [2022-02-21 00:03:14,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {4925#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:14,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:14,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:14,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {4926#(and (= (+ (select |#length| |~#numbers2~0.base|) (- 40)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (= |~#numbers2~0.offset| 0) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {4920#false} is VALID [2022-02-21 00:03:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:14,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:14,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40039936] [2022-02-21 00:03:14,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40039936] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:14,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200267475] [2022-02-21 00:03:14,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:14,558 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:14,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 00:03:14,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 00:03:14,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:14,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 00:03:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:14,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:15,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {4919#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !!(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} assume !(getNumbers_~i~0#1 < 10); {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} is VALID [2022-02-21 00:03:15,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {4930#(and (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3) (<= |~#array~0.offset| 0))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5030#(and (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {5030#(and (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {5034#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {5098#(and (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {5098#(and (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5102#(and (<= 0 (* |ULTIMATE.start_getNumbers2_~i~1#1| 4)) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:15,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {5102#(and (<= 0 (* |ULTIMATE.start_getNumbers2_~i~1#1| 4)) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {4920#false} is VALID [2022-02-21 00:03:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-02-21 00:03:15,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:17,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {5106#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} assume !(4 + (~#numbers2~0.offset + 4 * getNumbers2_~i~1#1) <= #length[~#numbers2~0.base] && 0 <= ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1); {4920#false} is VALID [2022-02-21 00:03:17,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {5110#(or (and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|))) (not (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5106#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|)))} is VALID [2022-02-21 00:03:17,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} assume !!(getNumbers2_~i~1#1 < 10); {5110#(or (and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |~#numbers2~0.offset|))) (not (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|))))} is VALID [2022-02-21 00:03:17,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} havoc getNumbers2_#t~mem3#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} assume !!(getNumbers2_~i~1#1 < 10); {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} havoc getNumbers2_#t~mem3#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} assume !!(getNumbers2_~i~1#1 < 10); {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} havoc getNumbers2_#t~mem3#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} assume !!(getNumbers2_~i~1#1 < 10); {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} havoc getNumbers2_#t~mem3#1; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} assume !!(getNumbers2_~i~1#1 < 10); {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {5178#(and (or (<= 9 (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 9 (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4) 1))))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {5114#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |~#numbers2~0.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))))} is VALID [2022-02-21 00:03:17,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5178#(and (or (<= 9 (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 9 (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4) 1))))} is VALID [2022-02-21 00:03:17,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume !!(getNumbers_~i~0#1 < 10); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {4919#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {5182#(and (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= 9 (div (+ (select |#length| |~#numbers2~0.base|) (* (- 1) |~#numbers2~0.offset|) (- 4)) 4))) (or (<= 8 (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4)) (<= (div |~#numbers2~0.offset| (- 4)) (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))))} is VALID [2022-02-21 00:03:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-02-21 00:03:17,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200267475] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:17,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:17,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-02-21 00:03:17,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826775278] [2022-02-21 00:03:17,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 00:03:17,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:17,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:17,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-21 00:03:17,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 00:03:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-02-21 00:03:17,603 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:18,579 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-02-21 00:03:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 00:03:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-02-21 00:03:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-02-21 00:03:18,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2022-02-21 00:03:18,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:18,674 INFO L225 Difference]: With dead ends: 121 [2022-02-21 00:03:18,674 INFO L226 Difference]: Without dead ends: 121 [2022-02-21 00:03:18,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2022-02-21 00:03:18,675 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 363 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:18,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 213 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:03:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-21 00:03:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-02-21 00:03:18,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:18,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,678 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:18,680 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-02-21 00:03:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-02-21 00:03:18,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:18,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:18,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-21 00:03:18,681 INFO L87 Difference]: Start difference. First operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-21 00:03:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:18,683 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-02-21 00:03:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-02-21 00:03:18,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:18,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:18,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:18,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-02-21 00:03:18,686 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2022-02-21 00:03:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:18,687 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-02-21 00:03:18,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-02-21 00:03:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-21 00:03:18,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:18,688 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:18,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:18,896 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2022-02-21 00:03:18,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:18,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525095647] [2022-02-21 00:03:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:19,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {5785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {5785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {5785#true} assume !(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {5785#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5785#true} is VALID [2022-02-21 00:03:19,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {5785#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {5787#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !!(getNumbers2_~i~1#1 < 10); {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} havoc getNumbers2_#t~mem3#1; {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !(getNumbers2_~i~1#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {5786#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {5786#false} is VALID [2022-02-21 00:03:19,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {5786#false} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {5786#false} is VALID [2022-02-21 00:03:19,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {5786#false} assume !!(getNumbers3_~i~2#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {5786#false} assume !(1 == #valid[getNumbers3_~numbers~1#1.base]); {5786#false} is VALID [2022-02-21 00:03:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:19,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:19,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525095647] [2022-02-21 00:03:19,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525095647] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:19,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085299933] [2022-02-21 00:03:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:19,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:19,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 00:03:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:19,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 00:03:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:19,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:19,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {5785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {5785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {5785#true} assume !(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {5785#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5785#true} is VALID [2022-02-21 00:03:19,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {5785#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:19,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {5899#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:19,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {5788#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !!(getNumbers2_~i~1#1 < 10); {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} havoc getNumbers2_#t~mem3#1; {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:19,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {5789#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !(getNumbers2_~i~1#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {5786#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {5786#false} is VALID [2022-02-21 00:03:19,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {5786#false} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {5786#false} is VALID [2022-02-21 00:03:19,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {5786#false} assume !!(getNumbers3_~i~2#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {5786#false} assume !(1 == #valid[getNumbers3_~numbers~1#1.base]); {5786#false} is VALID [2022-02-21 00:03:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:19,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:19,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {5786#false} assume !(1 == #valid[getNumbers3_~numbers~1#1.base]); {5786#false} is VALID [2022-02-21 00:03:19,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {5786#false} assume !!(getNumbers3_~i~2#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {5786#false} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {5786#false} is VALID [2022-02-21 00:03:19,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {5786#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {5786#false} is VALID [2022-02-21 00:03:19,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {6017#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} assume !(getNumbers2_~i~1#1 < 10); {5786#false} is VALID [2022-02-21 00:03:19,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6017#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} is VALID [2022-02-21 00:03:19,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} havoc getNumbers2_#t~mem3#1; {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:19,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:19,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:19,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} assume !!(getNumbers2_~i~1#1 < 10); {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:19,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6021#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:19,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} havoc getNumbers2_#t~mem3#1; {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:19,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:19,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:19,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} assume !!(getNumbers2_~i~1#1 < 10); {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:19,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6037#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:19,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} havoc getNumbers2_#t~mem3#1; {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !!(getNumbers2_~i~1#1 < 10); {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5793#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:19,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5792#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:19,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {5791#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:19,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {5785#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {5790#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {5785#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5785#true} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {5785#true} assume !(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {5785#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {5785#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {5785#true} assume !!(getNumbers_~i~0#1 < 10); {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {5785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {5785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {5785#true} is VALID [2022-02-21 00:03:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:19,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085299933] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:19,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:19,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-21 00:03:19,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620498634] [2022-02-21 00:03:19,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-21 00:03:19,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:19,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:19,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:03:19,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:03:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:19,723 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:19,884 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-02-21 00:03:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-21 00:03:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-21 00:03:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-21 00:03:19,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-21 00:03:19,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:19,972 INFO L225 Difference]: With dead ends: 121 [2022-02-21 00:03:19,972 INFO L226 Difference]: Without dead ends: 121 [2022-02-21 00:03:19,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:19,973 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:19,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 218 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-21 00:03:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-02-21 00:03:19,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:19,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,977 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:19,978 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-02-21 00:03:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-02-21 00:03:19,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:19,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:19,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-21 00:03:19,979 INFO L87 Difference]: Start difference. First operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-21 00:03:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:19,981 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-02-21 00:03:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-02-21 00:03:19,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:19,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:19,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:19,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-02-21 00:03:19,984 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2022-02-21 00:03:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:19,984 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-02-21 00:03:19,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-02-21 00:03:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-21 00:03:19,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:19,985 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:20,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:20,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 00:03:20,199 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2022-02-21 00:03:20,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:20,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721985646] [2022-02-21 00:03:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:20,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {6698#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {6698#true} is VALID [2022-02-21 00:03:20,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {6698#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {6698#true} assume !!(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {6698#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {6698#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {6698#true} assume !(getNumbers_~i~0#1 < 10); {6698#true} is VALID [2022-02-21 00:03:20,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {6698#true} is VALID [2022-02-21 00:03:20,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:20,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:20,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:20,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:20,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:20,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {6700#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {6701#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {6702#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {6703#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {6704#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {6705#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {6706#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {6707#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {6708#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,388 INFO L290 TraceCheckUtils]: 81: Hoare triple {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {6709#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6710#(<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:20,390 INFO L290 TraceCheckUtils]: 85: Hoare triple {6710#(<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {6699#false} is VALID [2022-02-21 00:03:20,390 INFO L290 TraceCheckUtils]: 86: Hoare triple {6699#false} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {6699#false} is VALID [2022-02-21 00:03:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:20,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:20,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721985646] [2022-02-21 00:03:20,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721985646] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:20,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433747368] [2022-02-21 00:03:20,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 00:03:20,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:20,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:20,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:20,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 00:03:20,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 00:03:20,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:20,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 00:03:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:20,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:21,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {6698#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} assume !(getNumbers_~i~0#1 < 10); {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {6714#(and (= 2 |~#array~0.base|) (<= |~#array~0.offset| 0) (<= 40 (select |#length| 2)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {6814#(and (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {6814#(and (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| 2) (<= 40 (select |#length| 2)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,639 INFO L290 TraceCheckUtils]: 63: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,646 INFO L290 TraceCheckUtils]: 78: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {6818#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,649 INFO L290 TraceCheckUtils]: 83: Hoare triple {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} havoc getNumbers2_#t~mem3#1; {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,649 INFO L290 TraceCheckUtils]: 84: Hoare triple {6960#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 2)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {6970#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {6970#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 40 (select |#length| 2)))} assume !!(getNumbers2_~i~1#1 < 10); {6974#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 40 (select |#length| 2)))} is VALID [2022-02-21 00:03:21,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {6974#(and (= 2 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 40 (select |#length| 2)))} assume !(4 + (getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~numbers~0#1.base] && 0 <= getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1); {6699#false} is VALID [2022-02-21 00:03:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-02-21 00:03:21,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:03:21,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433747368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:21,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:03:21,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2022-02-21 00:03:21,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814596815] [2022-02-21 00:03:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-02-21 00:03:21,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:21,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:21,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:21,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:03:21,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:03:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:03:21,669 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:21,950 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-21 00:03:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:03:21,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-02-21 00:03:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-21 00:03:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-21 00:03:21,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-02-21 00:03:22,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:22,002 INFO L225 Difference]: With dead ends: 120 [2022-02-21 00:03:22,002 INFO L226 Difference]: Without dead ends: 120 [2022-02-21 00:03:22,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-02-21 00:03:22,003 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 123 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:22,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 66 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-21 00:03:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-02-21 00:03:22,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:22,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,006 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,007 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,008 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-21 00:03:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-21 00:03:22,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:22,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:22,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-21 00:03:22,009 INFO L87 Difference]: Start difference. First operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-21 00:03:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,011 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-21 00:03:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-21 00:03:22,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:22,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:22,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:22,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-02-21 00:03:22,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2022-02-21 00:03:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:22,014 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-02-21 00:03:22,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-02-21 00:03:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-21 00:03:22,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:22,015 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:22,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:22,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 00:03:22,237 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2022-02-21 00:03:22,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:22,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81976754] [2022-02-21 00:03:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:22,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {7466#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,397 INFO L290 TraceCheckUtils]: 74: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,400 INFO L290 TraceCheckUtils]: 79: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,400 INFO L290 TraceCheckUtils]: 81: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,401 INFO L290 TraceCheckUtils]: 83: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {7468#(and (= (select |#valid| 3) 1) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {7469#(and (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1))} is VALID [2022-02-21 00:03:22,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {7469#(and (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {7470#(= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1)} is VALID [2022-02-21 00:03:22,404 INFO L290 TraceCheckUtils]: 88: Hoare triple {7470#(= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1)} assume !!(getNumbers3_~i~2#1 < 10); {7470#(= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1)} is VALID [2022-02-21 00:03:22,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {7470#(= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1)} assume !(1 == #valid[getNumbers3_~numbers~1#1.base]); {7467#false} is VALID [2022-02-21 00:03:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:22,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:22,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81976754] [2022-02-21 00:03:22,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81976754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:22,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:22,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:22,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449188287] [2022-02-21 00:03:22,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-02-21 00:03:22,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:22,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:22,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:03:22,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:03:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:03:22,421 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,550 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-21 00:03:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:03:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-02-21 00:03:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-21 00:03:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-21 00:03:22,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-02-21 00:03:22,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:22,591 INFO L225 Difference]: With dead ends: 118 [2022-02-21 00:03:22,591 INFO L226 Difference]: Without dead ends: 118 [2022-02-21 00:03:22,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:03:22,592 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:22,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-21 00:03:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-21 00:03:22,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:22,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,594 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,594 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,595 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-21 00:03:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-02-21 00:03:22,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:22,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:22,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 118 states. [2022-02-21 00:03:22,596 INFO L87 Difference]: Start difference. First operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 118 states. [2022-02-21 00:03:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:22,598 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-21 00:03:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-02-21 00:03:22,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:22,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:22,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:22,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-02-21 00:03:22,601 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2022-02-21 00:03:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:22,601 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-02-21 00:03:22,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-02-21 00:03:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-21 00:03:22,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:22,602 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:22,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:03:22,603 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2022-02-21 00:03:22,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:22,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128207619] [2022-02-21 00:03:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:22,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {7949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {7951#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,789 INFO L290 TraceCheckUtils]: 69: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,789 INFO L290 TraceCheckUtils]: 70: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:22,797 INFO L290 TraceCheckUtils]: 86: Hoare triple {7952#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {7953#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} is VALID [2022-02-21 00:03:22,798 INFO L290 TraceCheckUtils]: 87: Hoare triple {7953#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {7954#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:22,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {7954#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {7954#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:22,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {7954#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {7950#false} is VALID [2022-02-21 00:03:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-02-21 00:03:22,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:22,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128207619] [2022-02-21 00:03:22,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128207619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:22,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:22,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:03:22,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670920596] [2022-02-21 00:03:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-02-21 00:03:22,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:22,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:22,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:22,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:03:22,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:03:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:03:22,820 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,045 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-02-21 00:03:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:03:23,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-02-21 00:03:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:03:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:03:23,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-21 00:03:23,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:23,113 INFO L225 Difference]: With dead ends: 125 [2022-02-21 00:03:23,113 INFO L226 Difference]: Without dead ends: 125 [2022-02-21 00:03:23,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:03:23,114 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:23,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-21 00:03:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2022-02-21 00:03:23,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:23,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,117 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,117 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,118 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-02-21 00:03:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-02-21 00:03:23,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-21 00:03:23,120 INFO L87 Difference]: Start difference. First operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-21 00:03:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,121 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-02-21 00:03:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-02-21 00:03:23,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:23,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-02-21 00:03:23,124 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2022-02-21 00:03:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:23,124 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-02-21 00:03:23,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-21 00:03:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 00:03:23,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:23,125 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:23,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:03:23,126 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2022-02-21 00:03:23,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:23,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306977280] [2022-02-21 00:03:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:23,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {8456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {8456#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {8456#true} assume !!(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {8456#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {8456#true} assume !(getNumbers_~i~0#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {8456#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {8456#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {8456#true} assume !!(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {8456#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {8456#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {8456#true} havoc getNumbers2_#t~mem3#1; {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {8456#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8456#true} is VALID [2022-02-21 00:03:23,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {8456#true} assume !(getNumbers2_~i~1#1 < 10); {8456#true} is VALID [2022-02-21 00:03:23,203 INFO L290 TraceCheckUtils]: 86: Hoare triple {8456#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {8456#true} is VALID [2022-02-21 00:03:23,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {8456#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} is VALID [2022-02-21 00:03:23,204 INFO L290 TraceCheckUtils]: 88: Hoare triple {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} assume !!(getNumbers3_~i~2#1 < 10); {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} is VALID [2022-02-21 00:03:23,204 INFO L290 TraceCheckUtils]: 89: Hoare triple {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} is VALID [2022-02-21 00:03:23,204 INFO L290 TraceCheckUtils]: 90: Hoare triple {8458#(= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1)} assume !(1 == #valid[getNumbers3_~#numbers3~0#1.base]); {8457#false} is VALID [2022-02-21 00:03:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:23,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:23,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306977280] [2022-02-21 00:03:23,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306977280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:23,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:23,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:23,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595757769] [2022-02-21 00:03:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-21 00:03:23,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:23,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:23,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:23,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:23,220 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,269 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-02-21 00:03:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-21 00:03:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-21 00:03:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-21 00:03:23,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-02-21 00:03:23,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:23,312 INFO L225 Difference]: With dead ends: 119 [2022-02-21 00:03:23,312 INFO L226 Difference]: Without dead ends: 119 [2022-02-21 00:03:23,312 INFO L932 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 [2022-02-21 00:03:23,313 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:23,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-21 00:03:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-02-21 00:03:23,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:23,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,316 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,316 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,318 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-02-21 00:03:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-02-21 00:03:23,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-21 00:03:23,319 INFO L87 Difference]: Start difference. First operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-21 00:03:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,320 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-02-21 00:03:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-02-21 00:03:23,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:23,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-02-21 00:03:23,323 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2022-02-21 00:03:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:23,323 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-02-21 00:03:23,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-02-21 00:03:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 00:03:23,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:23,324 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:23,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:03:23,325 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:23,325 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2022-02-21 00:03:23,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:23,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491729917] [2022-02-21 00:03:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:23,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {8937#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {8937#true} is VALID [2022-02-21 00:03:23,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {8937#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {8937#true} is VALID [2022-02-21 00:03:23,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {8937#true} assume !!(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {8937#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {8937#true} assume !(getNumbers_~i~0#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {8937#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {8937#true} is VALID [2022-02-21 00:03:23,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {8937#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {8937#true} assume !!(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {8937#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {8937#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 83: Hoare triple {8937#true} havoc getNumbers2_#t~mem3#1; {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {8937#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {8937#true} assume !(getNumbers2_~i~1#1 < 10); {8937#true} is VALID [2022-02-21 00:03:23,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {8937#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {8937#true} is VALID [2022-02-21 00:03:23,428 INFO L290 TraceCheckUtils]: 87: Hoare triple {8937#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:23,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:23,430 INFO L290 TraceCheckUtils]: 89: Hoare triple {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:23,430 INFO L290 TraceCheckUtils]: 90: Hoare triple {8939#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {8938#false} is VALID [2022-02-21 00:03:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:23,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:23,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491729917] [2022-02-21 00:03:23,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491729917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:23,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:23,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:23,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974918467] [2022-02-21 00:03:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-21 00:03:23,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:23,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:23,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:23,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:23,447 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,512 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2022-02-21 00:03:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-21 00:03:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-21 00:03:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-21 00:03:23,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-02-21 00:03:23,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:23,553 INFO L225 Difference]: With dead ends: 122 [2022-02-21 00:03:23,553 INFO L226 Difference]: Without dead ends: 122 [2022-02-21 00:03:23,554 INFO L932 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 [2022-02-21 00:03:23,554 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:23,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-21 00:03:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-02-21 00:03:23,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:23,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,556 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,556 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,558 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2022-02-21 00:03:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-02-21 00:03:23,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-21 00:03:23,559 INFO L87 Difference]: Start difference. First operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 122 states. [2022-02-21 00:03:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:23,561 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2022-02-21 00:03:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-02-21 00:03:23,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:23,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:23,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:23,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-02-21 00:03:23,563 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2022-02-21 00:03:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:23,564 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-02-21 00:03:23,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-21 00:03:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-21 00:03:23,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:23,565 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:23,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:03:23,565 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2022-02-21 00:03:23,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:23,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129727624] [2022-02-21 00:03:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:23,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {9428#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {9430#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,788 INFO L290 TraceCheckUtils]: 73: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,788 INFO L290 TraceCheckUtils]: 74: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,789 INFO L290 TraceCheckUtils]: 75: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,789 INFO L290 TraceCheckUtils]: 76: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,791 INFO L290 TraceCheckUtils]: 80: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,793 INFO L290 TraceCheckUtils]: 83: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:23,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {9431#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {9432#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} is VALID [2022-02-21 00:03:23,796 INFO L290 TraceCheckUtils]: 87: Hoare triple {9432#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:23,796 INFO L290 TraceCheckUtils]: 88: Hoare triple {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:23,797 INFO L290 TraceCheckUtils]: 89: Hoare triple {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:23,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {9433#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {9434#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:23,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {9434#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {9434#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:23,799 INFO L290 TraceCheckUtils]: 92: Hoare triple {9434#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {9435#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:23,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {9435#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {9435#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:23,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {9435#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {9429#false} is VALID [2022-02-21 00:03:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-02-21 00:03:23,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:23,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129727624] [2022-02-21 00:03:23,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129727624] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:23,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065538143] [2022-02-21 00:03:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:23,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:23,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:23,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:23,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 00:03:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:23,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 00:03:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:23,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:25,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:03:25,190 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:03:25,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {9428#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,325 INFO L290 TraceCheckUtils]: 61: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,325 INFO L290 TraceCheckUtils]: 62: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,329 INFO L290 TraceCheckUtils]: 71: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,333 INFO L290 TraceCheckUtils]: 82: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,334 INFO L290 TraceCheckUtils]: 84: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,334 INFO L290 TraceCheckUtils]: 85: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:25,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {9439#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {9698#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,336 INFO L290 TraceCheckUtils]: 87: Hoare triple {9698#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,336 INFO L290 TraceCheckUtils]: 88: Hoare triple {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} assume !!(getNumbers3_~i~2#1 < 10); {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,337 INFO L290 TraceCheckUtils]: 91: Hoare triple {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} havoc getNumbers3_#t~mem6#1; {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {9702#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {9718#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {9718#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} assume !!(getNumbers3_~i~2#1 < 10); {9718#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:25,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {9718#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {9429#false} is VALID [2022-02-21 00:03:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:25,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:30,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {9725#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {9429#false} is VALID [2022-02-21 00:03:30,036 INFO L290 TraceCheckUtils]: 93: Hoare triple {9725#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} assume !!(getNumbers3_~i~2#1 < 10); {9725#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {9725#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,037 INFO L290 TraceCheckUtils]: 91: Hoare triple {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} havoc getNumbers3_#t~mem6#1; {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} assume !!(getNumbers3_~i~2#1 < 10); {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {9748#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (forall ((v_ArrVal_812 Int)) (<= (+ 8 |ULTIMATE.start_getNumbers2_#res#1.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |ULTIMATE.start_getNumbers2_#res#1.base|))) (<= 0 (+ 4 |ULTIMATE.start_getNumbers2_#res#1.offset|))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {9732#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)))} is VALID [2022-02-21 00:03:30,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {9748#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (forall ((v_ArrVal_812 Int)) (<= (+ 8 |ULTIMATE.start_getNumbers2_#res#1.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |ULTIMATE.start_getNumbers2_#res#1.base|))) (<= 0 (+ 4 |ULTIMATE.start_getNumbers2_#res#1.offset|))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,042 INFO L290 TraceCheckUtils]: 85: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,043 INFO L290 TraceCheckUtils]: 84: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,043 INFO L290 TraceCheckUtils]: 83: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,047 INFO L290 TraceCheckUtils]: 79: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,047 INFO L290 TraceCheckUtils]: 78: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} havoc getNumbers2_#t~mem3#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers2_~i~1#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume !!(getNumbers_~i~0#1 < 10); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {9428#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {9752#(forall ((|v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| Int)) (or (and (<= 0 (+ 4 |~#numbers2~0.offset|)) (forall ((v_ArrVal_812 Int)) (<= (+ 8 |~#numbers2~0.offset|) (select (store |#length| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15| v_ArrVal_812) |~#numbers2~0.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_getNumbers3_~#numbers3~0#1.base_15|) 0))))} is VALID [2022-02-21 00:03:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:30,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065538143] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:30,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:30,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-02-21 00:03:30,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498540292] [2022-02-21 00:03:30,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-21 00:03:30,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:30,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:30,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 00:03:30,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:30,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 00:03:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-02-21 00:03:30,182 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:31,042 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-02-21 00:03:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 00:03:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-21 00:03:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-21 00:03:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-21 00:03:31,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 118 transitions. [2022-02-21 00:03:31,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:31,163 INFO L225 Difference]: With dead ends: 180 [2022-02-21 00:03:31,163 INFO L226 Difference]: Without dead ends: 180 [2022-02-21 00:03:31,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 181 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2022-02-21 00:03:31,164 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 303 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:31,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 239 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 163 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-02-21 00:03:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-21 00:03:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2022-02-21 00:03:31,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:31,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,166 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,167 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:31,169 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-02-21 00:03:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2022-02-21 00:03:31,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:31,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:31,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 180 states. [2022-02-21 00:03:31,170 INFO L87 Difference]: Start difference. First operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 180 states. [2022-02-21 00:03:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:31,172 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2022-02-21 00:03:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2022-02-21 00:03:31,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:31,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:31,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:31,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2022-02-21 00:03:31,177 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2022-02-21 00:03:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:31,177 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2022-02-21 00:03:31,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2022-02-21 00:03:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-21 00:03:31,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:31,178 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:31,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:31,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:31,403 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2022-02-21 00:03:31,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:31,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851907256] [2022-02-21 00:03:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:31,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {10703#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {10703#true} is VALID [2022-02-21 00:03:31,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {10703#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {10703#true} is VALID [2022-02-21 00:03:31,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {10703#true} assume !(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {10703#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {10703#true} is VALID [2022-02-21 00:03:31,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {10703#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 67: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 75: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 76: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 77: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 78: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 79: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,528 INFO L290 TraceCheckUtils]: 81: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,529 INFO L290 TraceCheckUtils]: 83: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,529 INFO L290 TraceCheckUtils]: 85: Hoare triple {10703#true} assume !(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,529 INFO L290 TraceCheckUtils]: 86: Hoare triple {10703#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {10703#true} is VALID [2022-02-21 00:03:31,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {10703#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,532 INFO L290 TraceCheckUtils]: 90: Hoare triple {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,532 INFO L290 TraceCheckUtils]: 91: Hoare triple {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {10705#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,534 INFO L290 TraceCheckUtils]: 94: Hoare triple {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,534 INFO L290 TraceCheckUtils]: 95: Hoare triple {10706#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {10704#false} is VALID [2022-02-21 00:03:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:31,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:31,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851907256] [2022-02-21 00:03:31,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851907256] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:31,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536403181] [2022-02-21 00:03:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:31,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 00:03:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:31,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 00:03:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:31,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:31,875 INFO L390 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 [2022-02-21 00:03:31,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {10703#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {10703#true} is VALID [2022-02-21 00:03:31,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {10703#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {10703#true} is VALID [2022-02-21 00:03:31,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {10703#true} assume !(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {10703#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {10703#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {10703#true} is VALID [2022-02-21 00:03:31,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,974 INFO L290 TraceCheckUtils]: 74: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,975 INFO L290 TraceCheckUtils]: 81: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:31,976 INFO L290 TraceCheckUtils]: 82: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:31,976 INFO L290 TraceCheckUtils]: 83: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:31,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:31,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {10703#true} assume !(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:31,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {10703#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {10703#true} is VALID [2022-02-21 00:03:31,977 INFO L290 TraceCheckUtils]: 87: Hoare triple {10703#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,978 INFO L290 TraceCheckUtils]: 88: Hoare triple {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,979 INFO L290 TraceCheckUtils]: 90: Hoare triple {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,979 INFO L290 TraceCheckUtils]: 91: Hoare triple {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,980 INFO L290 TraceCheckUtils]: 92: Hoare triple {10971#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,980 INFO L290 TraceCheckUtils]: 93: Hoare triple {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:31,981 INFO L290 TraceCheckUtils]: 95: Hoare triple {10987#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= (+ (- 1) |ULTIMATE.start_getNumbers3_~i~2#1|) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {10704#false} is VALID [2022-02-21 00:03:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:31,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:32,195 INFO L290 TraceCheckUtils]: 95: Hoare triple {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {10704#false} is VALID [2022-02-21 00:03:32,196 INFO L290 TraceCheckUtils]: 94: Hoare triple {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} assume !!(getNumbers3_~i~2#1 < 10); {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {10997#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} havoc getNumbers3_#t~mem6#1; {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,198 INFO L290 TraceCheckUtils]: 90: Hoare triple {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} assume !!(getNumbers3_~i~2#1 < 10); {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 87: Hoare triple {10703#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {11007#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4)) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 8) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 86: Hoare triple {10703#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {10703#true} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {10703#true} assume !(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 83: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,200 INFO L290 TraceCheckUtils]: 82: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 63: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {10703#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {10703#true} havoc getNumbers2_#t~mem3#1; {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {10703#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {10703#true} is VALID [2022-02-21 00:03:32,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {10703#true} assume !!(getNumbers2_~i~1#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {10703#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {10703#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {10703#true} assume !(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {10703#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {10703#true} is VALID [2022-02-21 00:03:32,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {10703#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {10703#true} is VALID [2022-02-21 00:03:32,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {10703#true} assume !!(getNumbers_~i~0#1 < 10); {10703#true} is VALID [2022-02-21 00:03:32,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {10703#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {10703#true} is VALID [2022-02-21 00:03:32,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {10703#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {10703#true} is VALID [2022-02-21 00:03:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:32,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536403181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:32,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:32,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-02-21 00:03:32,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369377641] [2022-02-21 00:03:32,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-02-21 00:03:32,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:32,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:32,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:03:32,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:03:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:03:32,246 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:32,473 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-21 00:03:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:03:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-02-21 00:03:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 00:03:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-21 00:03:32,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-21 00:03:32,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:32,534 INFO L225 Difference]: With dead ends: 137 [2022-02-21 00:03:32,535 INFO L226 Difference]: Without dead ends: 137 [2022-02-21 00:03:32,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:32,535 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:32,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-21 00:03:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-02-21 00:03:32,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:32,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,538 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,538 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:32,540 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-21 00:03:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-02-21 00:03:32,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:32,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:32,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-21 00:03:32,540 INFO L87 Difference]: Start difference. First operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-21 00:03:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:32,542 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-21 00:03:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-02-21 00:03:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:32,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:32,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:32,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2022-02-21 00:03:32,551 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2022-02-21 00:03:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:32,552 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2022-02-21 00:03:32,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-02-21 00:03:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-21 00:03:32,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:32,553 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:32,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:32,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:32,780 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:32,780 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2022-02-21 00:03:32,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:32,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043822680] [2022-02-21 00:03:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {11831#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {11831#true} is VALID [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {11831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {11831#true} is VALID [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {11831#true} assume !(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {11831#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {11831#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:32,877 INFO L290 TraceCheckUtils]: 82: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:32,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:32,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:32,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {11831#true} assume !(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:32,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {11831#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {11831#true} is VALID [2022-02-21 00:03:32,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {11831#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:32,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} assume !!(getNumbers3_~i~2#1 < 10); {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:32,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:32,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:32,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} havoc getNumbers3_#t~mem6#1; {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:32,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {11833#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:32,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} assume !!(getNumbers3_~i~2#1 < 10); {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:32,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:32,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:32,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} havoc getNumbers3_#t~mem6#1; {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:32,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {11835#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:32,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {11835#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} assume !(getNumbers3_~i~2#1 < 10); {11832#false} is VALID [2022-02-21 00:03:32,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {11832#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {11832#false} is VALID [2022-02-21 00:03:32,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {11832#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {11832#false} is VALID [2022-02-21 00:03:32,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {11832#false} assume !!(getNumbers4_~i~3#1 < 10); {11832#false} is VALID [2022-02-21 00:03:32,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {11832#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {11832#false} is VALID [2022-02-21 00:03:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:32,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:32,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043822680] [2022-02-21 00:03:32,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043822680] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:32,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799977420] [2022-02-21 00:03:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:32,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:32,888 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 00:03:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:33,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:03:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:33,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:33,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {11831#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {11831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {11831#true} assume !(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {11831#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {11831#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {11831#true} is VALID [2022-02-21 00:03:33,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,298 INFO L290 TraceCheckUtils]: 66: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 69: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 71: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,300 INFO L290 TraceCheckUtils]: 81: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {11831#true} assume !(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {11831#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {11831#true} is VALID [2022-02-21 00:03:33,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {11831#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:33,308 INFO L290 TraceCheckUtils]: 88: Hoare triple {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} assume !!(getNumbers3_~i~2#1 < 10); {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:33,308 INFO L290 TraceCheckUtils]: 89: Hoare triple {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:33,308 INFO L290 TraceCheckUtils]: 90: Hoare triple {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:33,309 INFO L290 TraceCheckUtils]: 91: Hoare triple {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} havoc getNumbers3_#t~mem6#1; {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:33,309 INFO L290 TraceCheckUtils]: 92: Hoare triple {12100#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:33,310 INFO L290 TraceCheckUtils]: 93: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} assume !!(getNumbers3_~i~2#1 < 10); {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:33,310 INFO L290 TraceCheckUtils]: 94: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:33,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:33,311 INFO L290 TraceCheckUtils]: 96: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} havoc getNumbers3_#t~mem6#1; {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 97: Hoare triple {11834#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {11835#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 98: Hoare triple {11835#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} assume !(getNumbers3_~i~2#1 < 10); {11832#false} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 99: Hoare triple {11832#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {11832#false} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 100: Hoare triple {11832#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {11832#false} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 101: Hoare triple {11832#false} assume !!(getNumbers4_~i~3#1 < 10); {11832#false} is VALID [2022-02-21 00:03:33,313 INFO L290 TraceCheckUtils]: 102: Hoare triple {11832#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {11832#false} is VALID [2022-02-21 00:03:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:33,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:33,508 INFO L290 TraceCheckUtils]: 102: Hoare triple {11832#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {11832#false} is VALID [2022-02-21 00:03:33,508 INFO L290 TraceCheckUtils]: 101: Hoare triple {11832#false} assume !!(getNumbers4_~i~3#1 < 10); {11832#false} is VALID [2022-02-21 00:03:33,508 INFO L290 TraceCheckUtils]: 100: Hoare triple {11832#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {11832#false} is VALID [2022-02-21 00:03:33,508 INFO L290 TraceCheckUtils]: 99: Hoare triple {11832#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {11832#false} is VALID [2022-02-21 00:03:33,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {12158#(< |ULTIMATE.start_getNumbers3_~i~2#1| 10)} assume !(getNumbers3_~i~2#1 < 10); {11832#false} is VALID [2022-02-21 00:03:33,512 INFO L290 TraceCheckUtils]: 97: Hoare triple {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {12158#(< |ULTIMATE.start_getNumbers3_~i~2#1| 10)} is VALID [2022-02-21 00:03:33,512 INFO L290 TraceCheckUtils]: 96: Hoare triple {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} havoc getNumbers3_#t~mem6#1; {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:33,513 INFO L290 TraceCheckUtils]: 95: Hoare triple {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:33,513 INFO L290 TraceCheckUtils]: 94: Hoare triple {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:33,513 INFO L290 TraceCheckUtils]: 93: Hoare triple {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} assume !!(getNumbers3_~i~2#1 < 10); {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:33,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {12162#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:33,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} havoc getNumbers3_#t~mem6#1; {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:33,514 INFO L290 TraceCheckUtils]: 90: Hoare triple {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:33,514 INFO L290 TraceCheckUtils]: 89: Hoare triple {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} assume !!(getNumbers3_~i~2#1 < 10); {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {11831#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {12178#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {11831#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {11831#true} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {11831#true} assume !(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {11831#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {11831#true} havoc getNumbers2_#t~mem3#1; {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {11831#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {11831#true} assume !!(getNumbers2_~i~1#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {11831#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {11831#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {11831#true} assume !(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {11831#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {11831#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {11831#true} assume !!(getNumbers_~i~0#1 < 10); {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {11831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {11831#true} is VALID [2022-02-21 00:03:33,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {11831#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {11831#true} is VALID [2022-02-21 00:03:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:33,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799977420] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:33,527 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:33,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-21 00:03:33,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134394014] [2022-02-21 00:03:33,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:33,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-21 00:03:33,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:33,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:33,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 00:03:33,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 00:03:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:33,564 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:33,712 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-02-21 00:03:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:03:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-21 00:03:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-21 00:03:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-21 00:03:33,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-02-21 00:03:33,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:33,765 INFO L225 Difference]: With dead ends: 145 [2022-02-21 00:03:33,766 INFO L226 Difference]: Without dead ends: 145 [2022-02-21 00:03:33,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:33,767 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:33,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 195 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-21 00:03:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-02-21 00:03:33,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:33,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,770 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,770 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:33,772 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-02-21 00:03:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2022-02-21 00:03:33,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:33,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:33,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states. [2022-02-21 00:03:33,773 INFO L87 Difference]: Start difference. First operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 145 states. [2022-02-21 00:03:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:33,775 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-02-21 00:03:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2022-02-21 00:03:33,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:33,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:33,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:33,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2022-02-21 00:03:33,778 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2022-02-21 00:03:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:33,778 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2022-02-21 00:03:33,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-02-21 00:03:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-21 00:03:33,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:33,780 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:33,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:33,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-21 00:03:33,995 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2022-02-21 00:03:33,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:33,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91827232] [2022-02-21 00:03:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:34,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {13034#(and (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,369 INFO L290 TraceCheckUtils]: 75: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,370 INFO L290 TraceCheckUtils]: 76: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,372 INFO L290 TraceCheckUtils]: 80: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,372 INFO L290 TraceCheckUtils]: 81: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:34,375 INFO L290 TraceCheckUtils]: 86: Hoare triple {13035#(and (= (select |#valid| |~#numbers2~0.base|) 1) (= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {13036#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} is VALID [2022-02-21 00:03:34,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {13036#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= 40 (select |#length| 3)) (= (select |#valid| 3) 1))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:34,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:34,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:34,377 INFO L290 TraceCheckUtils]: 90: Hoare triple {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:34,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} is VALID [2022-02-21 00:03:34,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {13037#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,383 INFO L290 TraceCheckUtils]: 94: Hoare triple {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,384 INFO L290 TraceCheckUtils]: 95: Hoare triple {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} havoc getNumbers3_#t~mem6#1; {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {13038#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,387 INFO L290 TraceCheckUtils]: 100: Hoare triple {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} havoc getNumbers3_#t~mem6#1; {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {13039#(and (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,389 INFO L290 TraceCheckUtils]: 103: Hoare triple {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,389 INFO L290 TraceCheckUtils]: 104: Hoare triple {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {13040#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (not (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base| 3)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13041#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {13041#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} havoc getNumbers3_#t~mem6#1; {13041#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {13041#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13042#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,392 INFO L290 TraceCheckUtils]: 108: Hoare triple {13042#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13042#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:34,392 INFO L290 TraceCheckUtils]: 109: Hoare triple {13042#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {13033#false} is VALID [2022-02-21 00:03:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-02-21 00:03:34,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:34,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91827232] [2022-02-21 00:03:34,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91827232] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:34,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806059076] [2022-02-21 00:03:34,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:34,395 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:34,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 00:03:34,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:03:34,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:34,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-21 00:03:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:34,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:35,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:03:35,820 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:03:36,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {13032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers_~i~0#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,333 INFO L290 TraceCheckUtils]: 76: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,334 INFO L290 TraceCheckUtils]: 77: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,335 INFO L290 TraceCheckUtils]: 79: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,335 INFO L290 TraceCheckUtils]: 80: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !!(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,336 INFO L290 TraceCheckUtils]: 81: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} havoc getNumbers2_#t~mem3#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} assume !(getNumbers2_~i~1#1 < 10); {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} is VALID [2022-02-21 00:03:36,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {13046#(and (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)) (= |~#numbers2~0.offset| 0) (= |~#numbers2~0.base| 3))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {13305#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,339 INFO L290 TraceCheckUtils]: 87: Hoare triple {13305#(and (= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (= |ULTIMATE.start_getNumbers2_#res#1.base| 3) (= (select |#valid| 3) 1) (<= 40 (select |#length| 3)))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} assume !!(getNumbers3_~i~2#1 < 10); {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,341 INFO L290 TraceCheckUtils]: 89: Hoare triple {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,342 INFO L290 TraceCheckUtils]: 91: Hoare triple {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} havoc getNumbers3_#t~mem6#1; {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,342 INFO L290 TraceCheckUtils]: 92: Hoare triple {13309#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,343 INFO L290 TraceCheckUtils]: 93: Hoare triple {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} assume !!(getNumbers3_~i~2#1 < 10); {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,344 INFO L290 TraceCheckUtils]: 94: Hoare triple {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,344 INFO L290 TraceCheckUtils]: 95: Hoare triple {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,345 INFO L290 TraceCheckUtils]: 96: Hoare triple {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} havoc getNumbers3_#t~mem6#1; {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,345 INFO L290 TraceCheckUtils]: 97: Hoare triple {13325#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,346 INFO L290 TraceCheckUtils]: 98: Hoare triple {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,347 INFO L290 TraceCheckUtils]: 99: Hoare triple {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} havoc getNumbers3_#t~mem6#1; {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {13341#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} assume !!(getNumbers3_~i~2#1 < 10); {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,349 INFO L290 TraceCheckUtils]: 104: Hoare triple {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,350 INFO L290 TraceCheckUtils]: 105: Hoare triple {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,351 INFO L290 TraceCheckUtils]: 106: Hoare triple {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} havoc getNumbers3_#t~mem6#1; {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} is VALID [2022-02-21 00:03:36,351 INFO L290 TraceCheckUtils]: 107: Hoare triple {13357#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 40 (select |#length| 3)) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13373#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,352 INFO L290 TraceCheckUtils]: 108: Hoare triple {13373#(and (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} assume !!(getNumbers3_~i~2#1 < 10); {13377#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} is VALID [2022-02-21 00:03:36,352 INFO L290 TraceCheckUtils]: 109: Hoare triple {13377#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (= 3 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 40 (select |#length| 3)))} assume !(4 + (getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~numbers~1#1.base] && 0 <= getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1); {13033#false} is VALID [2022-02-21 00:03:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:36,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:03:36,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806059076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:36,354 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:03:36,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-02-21 00:03:36,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733030012] [2022-02-21 00:03:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:36,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-02-21 00:03:36,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:36,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 00:03:36,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 00:03:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:03:36,392 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,766 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-02-21 00:03:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 00:03:36,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-02-21 00:03:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-02-21 00:03:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-02-21 00:03:36,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-02-21 00:03:36,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,834 INFO L225 Difference]: With dead ends: 142 [2022-02-21 00:03:36,834 INFO L226 Difference]: Without dead ends: 142 [2022-02-21 00:03:36,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-02-21 00:03:36,835 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:36,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 104 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-21 00:03:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-02-21 00:03:36,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:36,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,837 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,838 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,839 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-02-21 00:03:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2022-02-21 00:03:36,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2022-02-21 00:03:36,840 INFO L87 Difference]: Start difference. First operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2022-02-21 00:03:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,842 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-02-21 00:03:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2022-02-21 00:03:36,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:36,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2022-02-21 00:03:36,845 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2022-02-21 00:03:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:36,845 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2022-02-21 00:03:36,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2022-02-21 00:03:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-21 00:03:36,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:36,847 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:36,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:37,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-21 00:03:37,071 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2022-02-21 00:03:37,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:37,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240505607] [2022-02-21 00:03:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:37,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:37,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {13962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {13962#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {13962#true} assume !!(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13962#true} is VALID [2022-02-21 00:03:37,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {13962#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {13962#true} assume !(getNumbers_~i~0#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {13962#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {13962#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 65: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 66: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 67: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 68: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 80: Hoare triple {13962#true} assume !!(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {13962#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {13962#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {13962#true} havoc getNumbers2_#t~mem3#1; {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {13962#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13962#true} is VALID [2022-02-21 00:03:37,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {13962#true} assume !(getNumbers2_~i~1#1 < 10); {13962#true} is VALID [2022-02-21 00:03:37,273 INFO L290 TraceCheckUtils]: 86: Hoare triple {13962#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {13962#true} is VALID [2022-02-21 00:03:37,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {13962#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,276 INFO L290 TraceCheckUtils]: 91: Hoare triple {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,276 INFO L290 TraceCheckUtils]: 92: Hoare triple {13964#(and (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,277 INFO L290 TraceCheckUtils]: 93: Hoare triple {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,277 INFO L290 TraceCheckUtils]: 94: Hoare triple {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,278 INFO L290 TraceCheckUtils]: 95: Hoare triple {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,279 INFO L290 TraceCheckUtils]: 96: Hoare triple {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {13965#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,280 INFO L290 TraceCheckUtils]: 98: Hoare triple {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,280 INFO L290 TraceCheckUtils]: 99: Hoare triple {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,281 INFO L290 TraceCheckUtils]: 100: Hoare triple {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,281 INFO L290 TraceCheckUtils]: 101: Hoare triple {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,282 INFO L290 TraceCheckUtils]: 102: Hoare triple {13966#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 2) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,283 INFO L290 TraceCheckUtils]: 103: Hoare triple {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,283 INFO L290 TraceCheckUtils]: 104: Hoare triple {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,284 INFO L290 TraceCheckUtils]: 105: Hoare triple {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,284 INFO L290 TraceCheckUtils]: 106: Hoare triple {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,285 INFO L290 TraceCheckUtils]: 107: Hoare triple {13967#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,285 INFO L290 TraceCheckUtils]: 108: Hoare triple {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,286 INFO L290 TraceCheckUtils]: 109: Hoare triple {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:37,287 INFO L290 TraceCheckUtils]: 110: Hoare triple {13968#(and (<= |ULTIMATE.start_getNumbers3_~i~2#1| 4) (<= 4 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {13963#false} is VALID [2022-02-21 00:03:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:37,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:37,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240505607] [2022-02-21 00:03:37,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240505607] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:37,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957909297] [2022-02-21 00:03:37,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:37,292 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 00:03:37,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 00:03:37,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:37,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:03:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:37,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:37,803 INFO L390 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 [2022-02-21 00:03:38,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {13962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !(getNumbers_~i~0#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,099 INFO L290 TraceCheckUtils]: 68: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,100 INFO L290 TraceCheckUtils]: 72: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,102 INFO L290 TraceCheckUtils]: 79: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !!(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} havoc getNumbers2_#t~mem3#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,103 INFO L290 TraceCheckUtils]: 84: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} assume !(getNumbers2_~i~1#1 < 10); {13972#(<= |~#numbers2~0.offset| 0)} is VALID [2022-02-21 00:03:38,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {13972#(<= |~#numbers2~0.offset| 0)} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {14231#(<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0)} is VALID [2022-02-21 00:03:38,112 INFO L290 TraceCheckUtils]: 87: Hoare triple {14231#(<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0)} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,112 INFO L290 TraceCheckUtils]: 88: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,112 INFO L290 TraceCheckUtils]: 89: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,113 INFO L290 TraceCheckUtils]: 90: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,113 INFO L290 TraceCheckUtils]: 91: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,114 INFO L290 TraceCheckUtils]: 92: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,114 INFO L290 TraceCheckUtils]: 93: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,115 INFO L290 TraceCheckUtils]: 95: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,115 INFO L290 TraceCheckUtils]: 96: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,116 INFO L290 TraceCheckUtils]: 97: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,116 INFO L290 TraceCheckUtils]: 98: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,116 INFO L290 TraceCheckUtils]: 99: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,117 INFO L290 TraceCheckUtils]: 100: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,117 INFO L290 TraceCheckUtils]: 101: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,118 INFO L290 TraceCheckUtils]: 102: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,118 INFO L290 TraceCheckUtils]: 103: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,119 INFO L290 TraceCheckUtils]: 105: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} havoc getNumbers3_#t~mem6#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {14235#(and (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !!(getNumbers3_~i~2#1 < 10); {14299#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,121 INFO L290 TraceCheckUtils]: 109: Hoare triple {14299#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14303#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 0 (* |ULTIMATE.start_getNumbers3_~i~2#1| 4)) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,121 INFO L290 TraceCheckUtils]: 110: Hoare triple {14303#(and (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 0 (* |ULTIMATE.start_getNumbers3_~i~2#1| 4)) (<= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {13963#false} is VALID [2022-02-21 00:03:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-02-21 00:03:38,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:39,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {14307#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} assume !(4 + (getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1) <= #length[getNumbers3_~#numbers3~0#1.base] && 0 <= getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1); {13963#false} is VALID [2022-02-21 00:03:39,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {14311#(or (not (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|))) (and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|))))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14307#(and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)))} is VALID [2022-02-21 00:03:39,148 INFO L290 TraceCheckUtils]: 108: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} assume !!(getNumbers3_~i~2#1 < 10); {14311#(or (not (<= 0 (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|))) (and (<= 0 (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4))) (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|))))} is VALID [2022-02-21 00:03:39,148 INFO L290 TraceCheckUtils]: 107: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,149 INFO L290 TraceCheckUtils]: 106: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} havoc getNumbers3_#t~mem6#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,150 INFO L290 TraceCheckUtils]: 105: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,151 INFO L290 TraceCheckUtils]: 103: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} assume !!(getNumbers3_~i~2#1 < 10); {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,151 INFO L290 TraceCheckUtils]: 102: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,152 INFO L290 TraceCheckUtils]: 101: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} havoc getNumbers3_#t~mem6#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,153 INFO L290 TraceCheckUtils]: 100: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,153 INFO L290 TraceCheckUtils]: 99: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,154 INFO L290 TraceCheckUtils]: 98: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} assume !!(getNumbers3_~i~2#1 < 10); {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,154 INFO L290 TraceCheckUtils]: 97: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,155 INFO L290 TraceCheckUtils]: 96: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} havoc getNumbers3_#t~mem6#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,156 INFO L290 TraceCheckUtils]: 95: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,156 INFO L290 TraceCheckUtils]: 94: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} assume !!(getNumbers3_~i~2#1 < 10); {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,157 INFO L290 TraceCheckUtils]: 92: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,158 INFO L290 TraceCheckUtils]: 91: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} havoc getNumbers3_#t~mem6#1; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,159 INFO L290 TraceCheckUtils]: 90: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,159 INFO L290 TraceCheckUtils]: 89: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} assume !!(getNumbers3_~i~2#1 < 10); {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {14379#(<= 0 (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers2_#res#1.offset|)) 4) 1))} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {14315#(and (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))) (or (<= (div |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4))) (<= 10 (div |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:39,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {14379#(<= 0 (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers2_#res#1.offset|)) 4) 1))} is VALID [2022-02-21 00:03:39,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,166 INFO L290 TraceCheckUtils]: 75: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,166 INFO L290 TraceCheckUtils]: 74: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} havoc getNumbers2_#t~mem3#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers2_~i~1#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume !!(getNumbers_~i~0#1 < 10); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {13962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {14383#(<= 0 (+ 2 (div (+ (* (- 1) |~#numbers2~0.offset|) (- 5)) 4)))} is VALID [2022-02-21 00:03:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-02-21 00:03:39,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957909297] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:39,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:39,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-02-21 00:03:39,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623014024] [2022-02-21 00:03:39,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-02-21 00:03:39,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:39,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:39,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:39,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 00:03:39,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 00:03:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:03:39,263 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:39,952 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-02-21 00:03:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-02-21 00:03:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-02-21 00:03:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-02-21 00:03:39,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2022-02-21 00:03:40,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:40,025 INFO L225 Difference]: With dead ends: 142 [2022-02-21 00:03:40,026 INFO L226 Difference]: Without dead ends: 142 [2022-02-21 00:03:40,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2022-02-21 00:03:40,026 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 260 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:40,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 173 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:03:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-21 00:03:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2022-02-21 00:03:40,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:40,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:40,029 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:40,029 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:40,031 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-02-21 00:03:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-02-21 00:03:40,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:40,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:40,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2022-02-21 00:03:40,032 INFO L87 Difference]: Start difference. First operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2022-02-21 00:03:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:40,034 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-02-21 00:03:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-02-21 00:03:40,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:40,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:40,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:40,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2022-02-21 00:03:40,036 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2022-02-21 00:03:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:40,037 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2022-02-21 00:03:40,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-02-21 00:03:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-21 00:03:40,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:40,038 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:40,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-21 00:03:40,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:40,252 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2022-02-21 00:03:40,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:40,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169418234] [2022-02-21 00:03:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:40,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:40,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {15227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {15227#true} is VALID [2022-02-21 00:03:40,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {15227#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {15227#true} is VALID [2022-02-21 00:03:40,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {15227#true} assume !(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {15227#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {15227#true} is VALID [2022-02-21 00:03:40,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {15227#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 77: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 79: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,398 INFO L290 TraceCheckUtils]: 81: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,399 INFO L290 TraceCheckUtils]: 82: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,399 INFO L290 TraceCheckUtils]: 83: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,399 INFO L290 TraceCheckUtils]: 85: Hoare triple {15227#true} assume !(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,399 INFO L290 TraceCheckUtils]: 86: Hoare triple {15227#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {15227#true} is VALID [2022-02-21 00:03:40,400 INFO L290 TraceCheckUtils]: 87: Hoare triple {15227#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,400 INFO L290 TraceCheckUtils]: 88: Hoare triple {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} assume !!(getNumbers3_~i~2#1 < 10); {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,401 INFO L290 TraceCheckUtils]: 90: Hoare triple {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,401 INFO L290 TraceCheckUtils]: 91: Hoare triple {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} havoc getNumbers3_#t~mem6#1; {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,401 INFO L290 TraceCheckUtils]: 92: Hoare triple {15229#(= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} assume !!(getNumbers3_~i~2#1 < 10); {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,402 INFO L290 TraceCheckUtils]: 95: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,402 INFO L290 TraceCheckUtils]: 96: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} havoc getNumbers3_#t~mem6#1; {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,403 INFO L290 TraceCheckUtils]: 97: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,403 INFO L290 TraceCheckUtils]: 98: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} assume !!(getNumbers3_~i~2#1 < 10); {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,404 INFO L290 TraceCheckUtils]: 101: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} havoc getNumbers3_#t~mem6#1; {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,405 INFO L290 TraceCheckUtils]: 103: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} assume !!(getNumbers3_~i~2#1 < 10); {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,405 INFO L290 TraceCheckUtils]: 104: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,406 INFO L290 TraceCheckUtils]: 105: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,406 INFO L290 TraceCheckUtils]: 106: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} havoc getNumbers3_#t~mem6#1; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,406 INFO L290 TraceCheckUtils]: 107: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,407 INFO L290 TraceCheckUtils]: 108: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} assume !!(getNumbers3_~i~2#1 < 10); {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,407 INFO L290 TraceCheckUtils]: 110: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,408 INFO L290 TraceCheckUtils]: 111: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} havoc getNumbers3_#t~mem6#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,408 INFO L290 TraceCheckUtils]: 112: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} assume !!(getNumbers3_~i~2#1 < 10); {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,409 INFO L290 TraceCheckUtils]: 114: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,409 INFO L290 TraceCheckUtils]: 115: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,409 INFO L290 TraceCheckUtils]: 116: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} havoc getNumbers3_#t~mem6#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,410 INFO L290 TraceCheckUtils]: 117: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:40,410 INFO L290 TraceCheckUtils]: 118: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} assume !(getNumbers3_~i~2#1 < 10); {15228#false} is VALID [2022-02-21 00:03:40,410 INFO L290 TraceCheckUtils]: 119: Hoare triple {15228#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {15228#false} is VALID [2022-02-21 00:03:40,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {15228#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {15228#false} is VALID [2022-02-21 00:03:40,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {15228#false} assume !!(getNumbers4_~i~3#1 < 10); {15228#false} is VALID [2022-02-21 00:03:40,411 INFO L290 TraceCheckUtils]: 122: Hoare triple {15228#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {15228#false} is VALID [2022-02-21 00:03:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:40,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:40,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169418234] [2022-02-21 00:03:40,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169418234] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:40,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688516545] [2022-02-21 00:03:40,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:40,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:03:40,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 00:03:40,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:03:40,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:40,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 00:03:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:40,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:40,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {15227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {15227#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {15227#true} assume !(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {15227#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {15227#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 77: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 80: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:40,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:40,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:40,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {15227#true} assume !(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:40,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {15227#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {15227#true} is VALID [2022-02-21 00:03:40,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {15227#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} assume !!(getNumbers3_~i~2#1 < 10); {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,948 INFO L290 TraceCheckUtils]: 89: Hoare triple {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,949 INFO L290 TraceCheckUtils]: 90: Hoare triple {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,949 INFO L290 TraceCheckUtils]: 91: Hoare triple {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} havoc getNumbers3_#t~mem6#1; {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} is VALID [2022-02-21 00:03:40,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {15500#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 0)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,950 INFO L290 TraceCheckUtils]: 93: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} assume !!(getNumbers3_~i~2#1 < 10); {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,950 INFO L290 TraceCheckUtils]: 94: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,950 INFO L290 TraceCheckUtils]: 95: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,951 INFO L290 TraceCheckUtils]: 96: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} havoc getNumbers3_#t~mem6#1; {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} is VALID [2022-02-21 00:03:40,951 INFO L290 TraceCheckUtils]: 97: Hoare triple {15230#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 1)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,952 INFO L290 TraceCheckUtils]: 98: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} assume !!(getNumbers3_~i~2#1 < 10); {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,952 INFO L290 TraceCheckUtils]: 99: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,952 INFO L290 TraceCheckUtils]: 100: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} havoc getNumbers3_#t~mem6#1; {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} is VALID [2022-02-21 00:03:40,953 INFO L290 TraceCheckUtils]: 102: Hoare triple {15231#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 2)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,953 INFO L290 TraceCheckUtils]: 103: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} assume !!(getNumbers3_~i~2#1 < 10); {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,954 INFO L290 TraceCheckUtils]: 104: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,954 INFO L290 TraceCheckUtils]: 105: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,955 INFO L290 TraceCheckUtils]: 106: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} havoc getNumbers3_#t~mem6#1; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:40,955 INFO L290 TraceCheckUtils]: 107: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,955 INFO L290 TraceCheckUtils]: 108: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} assume !!(getNumbers3_~i~2#1 < 10); {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,956 INFO L290 TraceCheckUtils]: 110: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,956 INFO L290 TraceCheckUtils]: 111: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} havoc getNumbers3_#t~mem6#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:40,957 INFO L290 TraceCheckUtils]: 112: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,957 INFO L290 TraceCheckUtils]: 113: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} assume !!(getNumbers3_~i~2#1 < 10); {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,958 INFO L290 TraceCheckUtils]: 114: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,958 INFO L290 TraceCheckUtils]: 115: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,958 INFO L290 TraceCheckUtils]: 116: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} havoc getNumbers3_#t~mem6#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:40,959 INFO L290 TraceCheckUtils]: 117: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:40,959 INFO L290 TraceCheckUtils]: 118: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} assume !(getNumbers3_~i~2#1 < 10); {15228#false} is VALID [2022-02-21 00:03:40,959 INFO L290 TraceCheckUtils]: 119: Hoare triple {15228#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {15228#false} is VALID [2022-02-21 00:03:40,960 INFO L290 TraceCheckUtils]: 120: Hoare triple {15228#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {15228#false} is VALID [2022-02-21 00:03:40,960 INFO L290 TraceCheckUtils]: 121: Hoare triple {15228#false} assume !!(getNumbers4_~i~3#1 < 10); {15228#false} is VALID [2022-02-21 00:03:40,960 INFO L290 TraceCheckUtils]: 122: Hoare triple {15228#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {15228#false} is VALID [2022-02-21 00:03:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:40,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:41,256 INFO L290 TraceCheckUtils]: 122: Hoare triple {15228#false} assume !(1 == #valid[getNumbers4_~numbers~2#1.base]); {15228#false} is VALID [2022-02-21 00:03:41,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {15228#false} assume !!(getNumbers4_~i~3#1 < 10); {15228#false} is VALID [2022-02-21 00:03:41,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {15228#false} getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset := getNumbers3_#res#1.base, getNumbers3_#res#1.offset;assume { :end_inline_getNumbers3 } true;getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset := getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset;getNumbers4_~i~3#1 := 0; {15228#false} is VALID [2022-02-21 00:03:41,257 INFO L290 TraceCheckUtils]: 119: Hoare triple {15228#false} getNumbers3_#res#1.base, getNumbers3_#res#1.offset := getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; {15228#false} is VALID [2022-02-21 00:03:41,258 INFO L290 TraceCheckUtils]: 118: Hoare triple {15618#(< |ULTIMATE.start_getNumbers3_~i~2#1| 10)} assume !(getNumbers3_~i~2#1 < 10); {15228#false} is VALID [2022-02-21 00:03:41,259 INFO L290 TraceCheckUtils]: 117: Hoare triple {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15618#(< |ULTIMATE.start_getNumbers3_~i~2#1| 10)} is VALID [2022-02-21 00:03:41,259 INFO L290 TraceCheckUtils]: 116: Hoare triple {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} havoc getNumbers3_#t~mem6#1; {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:41,259 INFO L290 TraceCheckUtils]: 115: Hoare triple {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:41,260 INFO L290 TraceCheckUtils]: 114: Hoare triple {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:41,260 INFO L290 TraceCheckUtils]: 113: Hoare triple {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} assume !!(getNumbers3_~i~2#1 < 10); {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:41,260 INFO L290 TraceCheckUtils]: 112: Hoare triple {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15622#(< |ULTIMATE.start_getNumbers3_~i~2#1| 9)} is VALID [2022-02-21 00:03:41,261 INFO L290 TraceCheckUtils]: 111: Hoare triple {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} havoc getNumbers3_#t~mem6#1; {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:41,261 INFO L290 TraceCheckUtils]: 110: Hoare triple {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:41,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:41,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} assume !!(getNumbers3_~i~2#1 < 10); {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:41,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15638#(< |ULTIMATE.start_getNumbers3_~i~2#1| 8)} is VALID [2022-02-21 00:03:41,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} havoc getNumbers3_#t~mem6#1; {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:41,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:41,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:41,264 INFO L290 TraceCheckUtils]: 103: Hoare triple {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} assume !!(getNumbers3_~i~2#1 < 10); {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:41,264 INFO L290 TraceCheckUtils]: 102: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15235#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 6)} is VALID [2022-02-21 00:03:41,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} havoc getNumbers3_#t~mem6#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:41,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:41,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:41,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} assume !!(getNumbers3_~i~2#1 < 10); {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:41,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15234#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 5)} is VALID [2022-02-21 00:03:41,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} havoc getNumbers3_#t~mem6#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:41,267 INFO L290 TraceCheckUtils]: 95: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:41,267 INFO L290 TraceCheckUtils]: 94: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:41,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} assume !!(getNumbers3_~i~2#1 < 10); {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:41,268 INFO L290 TraceCheckUtils]: 92: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} getNumbers3_#t~pre5#1 := 1 + getNumbers3_~i~2#1;getNumbers3_~i~2#1 := 1 + getNumbers3_~i~2#1;havoc getNumbers3_#t~pre5#1; {15233#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 4)} is VALID [2022-02-21 00:03:41,268 INFO L290 TraceCheckUtils]: 91: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} havoc getNumbers3_#t~mem6#1; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:41,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call write~int(getNumbers3_#t~mem6#1, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28-1 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:41,269 INFO L290 TraceCheckUtils]: 89: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} SUMMARY for call getNumbers3_#t~mem6#1 := read~int(getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset + 4 * getNumbers3_~i~2#1, 4); srcloc: L28 {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:41,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} assume !!(getNumbers3_~i~2#1 < 10); {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:41,270 INFO L290 TraceCheckUtils]: 87: Hoare triple {15227#true} getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset := getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset;call getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset := #Ultimate.allocOnStack(40);getNumbers3_~i~2#1 := 0; {15232#(<= |ULTIMATE.start_getNumbers3_~i~2#1| 3)} is VALID [2022-02-21 00:03:41,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {15227#true} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := ~#numbers2~0.base, ~#numbers2~0.offset; {15227#true} is VALID [2022-02-21 00:03:41,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {15227#true} assume !(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 75: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 73: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 72: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {15227#true} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {15227#true} havoc getNumbers2_#t~mem3#1; {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers2_#t~mem3#1, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19-1 {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {15227#true} SUMMARY for call getNumbers2_#t~mem3#1 := read~int(getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L19 {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {15227#true} assume !!(getNumbers2_~i~1#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {15227#true} getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset := getNumbers_#res#1.base, getNumbers_#res#1.offset;assume { :end_inline_getNumbers } true;getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset := getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset;getNumbers2_~i~1#1 := 0; {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {15227#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {15227#true} assume !(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {15227#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {15227#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L9 {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {15227#true} assume !!(getNumbers_~i~0#1 < 10); {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {15227#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~nondet12#1, main_#t~mem13#1, main_#t~post11#1, main_~i~4#1, main_~numbers~3#1.base, main_~numbers~3#1.offset;assume { :begin_inline_getNumbers4 } true;havoc getNumbers4_#res#1.base, getNumbers4_#res#1.offset;havoc getNumbers4_#t~ret7#1.base, getNumbers4_#t~ret7#1.offset, getNumbers4_#t~mem9#1, getNumbers4_#t~pre8#1, getNumbers4_~i~3#1, getNumbers4_~numbers~2#1.base, getNumbers4_~numbers~2#1.offset;assume { :begin_inline_getNumbers3 } true;havoc getNumbers3_#res#1.base, getNumbers3_#res#1.offset;havoc getNumbers3_#t~ret4#1.base, getNumbers3_#t~ret4#1.offset, getNumbers3_#t~mem6#1, getNumbers3_#t~pre5#1, getNumbers3_~i~2#1, getNumbers3_~numbers~1#1.base, getNumbers3_~numbers~1#1.offset, getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset;assume { :begin_inline_getNumbers2 } true;havoc getNumbers2_#res#1.base, getNumbers2_#res#1.offset;havoc getNumbers2_#t~ret1#1.base, getNumbers2_#t~ret1#1.offset, getNumbers2_#t~mem3#1, getNumbers2_#t~pre2#1, getNumbers2_~i~1#1, getNumbers2_~numbers~0#1.base, getNumbers2_~numbers~0#1.offset;assume { :begin_inline_getNumbers } true;havoc getNumbers_#res#1.base, getNumbers_#res#1.offset;havoc getNumbers_#t~pre0#1, getNumbers_~i~0#1;getNumbers_~i~0#1 := 0; {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {15227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#array~0.base, ~#array~0.offset := 2, 0;call #Ultimate.allocInit(40, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);~#numbers2~0.base, ~#numbers2~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers2~0.base);~#numbers4~0.base, ~#numbers4~0.offset := 4, 0;call #Ultimate.allocInit(40, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#numbers4~0.base); {15227#true} is VALID [2022-02-21 00:03:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2022-02-21 00:03:41,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688516545] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:41,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:41,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-21 00:03:41,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274167112] [2022-02-21 00:03:41,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-02-21 00:03:41,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:41,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:41,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:03:41,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:03:41,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:41,339 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:41,475 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-02-21 00:03:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:41,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-02-21 00:03:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2022-02-21 00:03:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2022-02-21 00:03:41,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2022-02-21 00:03:41,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:41,555 INFO L225 Difference]: With dead ends: 161 [2022-02-21 00:03:41,555 INFO L226 Difference]: Without dead ends: 161 [2022-02-21 00:03:41,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:41,557 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:41,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-21 00:03:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-02-21 00:03:41,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:41,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,561 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,561 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:41,564 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-02-21 00:03:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-02-21 00:03:41,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:41,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:41,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-21 00:03:41,565 INFO L87 Difference]: Start difference. First operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-21 00:03:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:41,568 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-02-21 00:03:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-02-21 00:03:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:41,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:41,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:41,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2022-02-21 00:03:41,572 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2022-02-21 00:03:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:41,572 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2022-02-21 00:03:41,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-02-21 00:03:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-21 00:03:41,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:41,573 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:41,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:41,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:41,791 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2022-02-21 00:03:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2022-02-21 00:03:41,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:41,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173650544] [2022-02-21 00:03:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:41,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:03:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:42,102 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:03:42,103 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:03:42,104 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (16 of 17 remaining) [2022-02-21 00:03:42,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 17 remaining) [2022-02-21 00:03:42,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 17 remaining) [2022-02-21 00:03:42,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 17 remaining) [2022-02-21 00:03:42,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (5 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (4 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (3 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (2 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (1 of 17 remaining) [2022-02-21 00:03:42,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-02-21 00:03:42,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:03:42,110 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:42,113 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:42,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:42 BoogieIcfgContainer [2022-02-21 00:03:42,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:42,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:42,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:42,241 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:42,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:58" (3/4) ... [2022-02-21 00:03:42,243 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:03:42,330 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:42,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:42,332 INFO L158 Benchmark]: Toolchain (without parser) took 44275.73ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 65.3MB in the beginning and 92.5MB in the end (delta: -27.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,332 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:42,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.32ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 72.2MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,332 INFO L158 Benchmark]: Boogie Preprocessor took 22.04ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:42,333 INFO L158 Benchmark]: RCFGBuilder took 474.96ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 50.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,333 INFO L158 Benchmark]: TraceAbstraction took 43337.94ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 50.4MB in the beginning and 118.7MB in the end (delta: -68.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,333 INFO L158 Benchmark]: Witness Printer took 90.13ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 92.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-02-21 00:03:42,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.32ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 72.2MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.04ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 474.96ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 50.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43337.94ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 50.4MB in the beginning and 118.7MB in the end (delta: -68.3MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 90.13ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 92.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={2:0}, numbers2={3:0}, numbers4={4:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L8] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L12] return array; VAL [\result={2:0}, array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L18] ++i VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L18] ++i VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L18] ++i VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L18] ++i VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L18] ++i VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L18] ++i VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L18] ++i VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L18] ++i VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L18] ++i VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L18] ++i VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L21] return numbers2; VAL [\result={3:0}, array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L27] ++i VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L27] ++i VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L27] ++i VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L27] ++i VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L27] ++i VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L27] ++i VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L27] ++i VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L27] ++i VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L27] ++i VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L27] ++i VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers4={4:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L37] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L38] numbers[i] - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3184 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3184 mSDsluCounter, 3144 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 2266 mSDsCounter, 390 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2734 IncrementalHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 390 mSolverCounterUnsat, 878 mSDtfsCounter, 2734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2104 GetRequests, 1770 SyntacticMatches, 6 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 2742 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3372 ConstructedInterpolants, 87 QuantifiedInterpolants, 28391 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3619 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 11661/12711 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 00:03:42,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)