./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.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/getNumbers2.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 cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:49,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:49,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:49,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:49,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:49,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:49,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:49,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:49,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:49,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:49,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:49,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:49,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:49,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:49,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:49,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:49,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:49,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:49,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:49,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:49,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:49,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:49,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:49,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:49,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:49,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:49,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:49,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:49,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:49,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:49,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:49,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:49,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:49,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:49,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:49,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:49,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:49,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:49,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:49,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:49,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:49,341 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:49,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:49,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:49,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:49,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:49,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:49,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:49,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:49,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:49,382 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:49,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:49,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:49,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:49,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:49,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:49,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:49,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:49,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:49,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:49,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:49,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:49,386 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 -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2022-02-21 00:02:49,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:49,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:49,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:49,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:49,627 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:49,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2022-02-21 00:02:49,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de79b2c/022f5163892d4ad1a9af9201eefc75a3/FLAG5453ecf33 [2022-02-21 00:02:50,026 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:50,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2022-02-21 00:02:50,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de79b2c/022f5163892d4ad1a9af9201eefc75a3/FLAG5453ecf33 [2022-02-21 00:02:50,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de79b2c/022f5163892d4ad1a9af9201eefc75a3 [2022-02-21 00:02:50,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:50,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:50,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:50,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:50,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:50,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:50" (1/1) ... [2022-02-21 00:02:50,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39819b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:50, skipping insertion in model container [2022-02-21 00:02:50,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:50" (1/1) ... [2022-02-21 00:02:50,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:50,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:50,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:50,241 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:50,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:50,264 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:50,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:50 WrapperNode [2022-02-21 00:02:50,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:50,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:50,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:50,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:50,272 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:50" (1/1) ... [2022-02-21 00:02:50,277 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:50" (1/1) ... [2022-02-21 00:02:50,295 INFO L137 Inliner]: procedures = 10, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-02-21 00:02:50,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:50,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:50,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:50,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:50,301 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:50" (1/1) ... [2022-02-21 00:02:50,302 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:50" (1/1) ... [2022-02-21 00:02:50,309 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:50" (1/1) ... [2022-02-21 00:02:50,309 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:50" (1/1) ... [2022-02-21 00:02:50,322 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:50" (1/1) ... [2022-02-21 00:02:50,326 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:50" (1/1) ... [2022-02-21 00:02:50,327 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:50" (1/1) ... [2022-02-21 00:02:50,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:50,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:50,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:50,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:50,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:50" (1/1) ... [2022-02-21 00:02:50,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:50,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:50,356 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:50,374 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:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:50,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:02:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 00:02:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:50,440 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:50,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:50,655 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:50,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:50,662 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 00:02:50,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:50 BoogieIcfgContainer [2022-02-21 00:02:50,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:50,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:50,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:50,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:50,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:50" (1/3) ... [2022-02-21 00:02:50,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:50, skipping insertion in model container [2022-02-21 00:02:50,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:50" (2/3) ... [2022-02-21 00:02:50,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:50, skipping insertion in model container [2022-02-21 00:02:50,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:50" (3/3) ... [2022-02-21 00:02:50,670 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2022-02-21 00:02:50,675 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:50,676 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-02-21 00:02:50,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:50,732 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:50,732 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-21 00:02:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 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:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:50,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:50,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:50,754 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 00:02:50,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:50,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138892024] [2022-02-21 00:02:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#array~0.base|)))} is VALID [2022-02-21 00:02:51,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#array~0.base|)))} is VALID [2022-02-21 00:02:51,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#array~0.base|)))} assume !!(getNumbers_~i~0#1 < 10); {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#array~0.base|)))} is VALID [2022-02-21 00:02:51,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#(and (= (select |#valid| |~#array~0.base|) 1) (= (select |#valid| 1) (select |#valid| |~#array~0.base|)))} assume !(1 == #valid[~#array~0.base]); {32#false} is VALID [2022-02-21 00:02:51,091 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:51,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:51,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138892024] [2022-02-21 00:02:51,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138892024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:51,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:51,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 00:02:51,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778351096] [2022-02-21 00:02:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:51,099 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:51,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:51,102 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:51,125 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:51,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:51,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:51,163 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 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:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,289 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 00:02:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:51,290 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:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:51,291 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:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-21 00:02:51,303 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:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-21 00:02:51,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-21 00:02:51,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,361 INFO L225 Difference]: With dead ends: 27 [2022-02-21 00:02:51,362 INFO L226 Difference]: Without dead ends: 25 [2022-02-21 00:02:51,364 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:51,375 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:51,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-21 00:02:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 00:02:51,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:51,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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:51,421 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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:51,422 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,427 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 00:02:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 00:02:51,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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 25 states. [2022-02-21 00:02:51,430 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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 25 states. [2022-02-21 00:02:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,436 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 00:02:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 00:02:51,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:51,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-21 00:02:51,440 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2022-02-21 00:02:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:51,441 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 00:02:51,441 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:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 00:02:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:51,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:51,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:51,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:51,449 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-21 00:02:51,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:51,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876859047] [2022-02-21 00:02:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {140#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:02:51,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {141#(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:51,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(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); {141#(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:51,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#(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); {139#false} is VALID [2022-02-21 00:02:51,613 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:51,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:51,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876859047] [2022-02-21 00:02:51,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876859047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:51,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:51,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:51,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86249705] [2022-02-21 00:02:51,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:51,630 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:51,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:51,631 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:51,638 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:51,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:02:51,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:02:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:02:51,640 INFO L87 Difference]: Start difference. First operand 25 states and 26 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:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,757 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 00:02:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:02:51,758 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:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:51,758 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:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-21 00:02:51,759 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:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-21 00:02:51,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-02-21 00:02:51,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,798 INFO L225 Difference]: With dead ends: 28 [2022-02-21 00:02:51,798 INFO L226 Difference]: Without dead ends: 28 [2022-02-21 00:02:51,798 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:51,799 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:51,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-21 00:02:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-02-21 00:02:51,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:51,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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:51,803 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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:51,803 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,804 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 00:02:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-21 00:02:51,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 states. [2022-02-21 00:02:51,805 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 states. [2022-02-21 00:02:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,806 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 00:02:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-21 00:02:51,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:51,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-02-21 00:02:51,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2022-02-21 00:02:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:51,808 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-21 00:02:51,809 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:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-21 00:02:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:02:51,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:51,809 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-02-21 00:02:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:51,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2022-02-21 00:02:51,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:51,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795809003] [2022-02-21 00:02:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {257#(and (= |~#array~0.offset| 0) (= (+ (- 40) (select |#length| |~#array~0.base|)) 0))} is VALID [2022-02-21 00:02:51,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {258#(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:51,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(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); {258#(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:51,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#(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: L6 {258#(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:51,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(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; {259#(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:02:51,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(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); {260#(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:02:51,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(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); {256#false} is VALID [2022-02-21 00:02:51,942 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:02:51,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:51,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795809003] [2022-02-21 00:02:51,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795809003] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:51,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707387823] [2022-02-21 00:02:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:51,964 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:02:51,965 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:02:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:02:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:52,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {264#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#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: L6 {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#(and (= |ULTIMATE.start_getNumbers_~i~0#1| 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#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; {278#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {278#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:52,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#(and (= (+ (- 1) |ULTIMATE.start_getNumbers_~i~0#1|) 0) (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1))} assume !(4 + (~#array~0.offset + 4 * getNumbers_~i~0#1) <= #length[~#array~0.base] && 0 <= ~#array~0.offset + 4 * getNumbers_~i~0#1); {256#false} is VALID [2022-02-21 00:02:52,153 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:02:52,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:52,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(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); {256#false} is VALID [2022-02-21 00:02:52,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(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); {285#(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:02:52,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#(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; {285#(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:02:52,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#(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: L6 {292#(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:02:52,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(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); {292#(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:02:52,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {292#(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:02:52,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {302#(and (<= 0 (+ |~#array~0.offset| 4)) (<= (+ |~#array~0.offset| 8) (select |#length| |~#array~0.base|)))} is VALID [2022-02-21 00:02:52,291 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:02:52,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707387823] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:52,291 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:52,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-02-21 00:02:52,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067415202] [2022-02-21 00:02:52,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:52,292 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:02:52,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:52,292 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:02:52,313 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:02:52,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 00:02:52,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:52,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 00:02:52,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-21 00:02:52,314 INFO L87 Difference]: Start difference. First operand 27 states and 28 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:02:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,791 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-21 00:02:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:02:52,791 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:02:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:52,792 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:02:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 00:02:52,793 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:02:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 00:02:52,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-21 00:02:52,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:52,843 INFO L225 Difference]: With dead ends: 34 [2022-02-21 00:02:52,843 INFO L226 Difference]: Without dead ends: 34 [2022-02-21 00:02:52,844 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:02:52,845 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 108 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:52,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:02:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-21 00:02:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-21 00:02:52,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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:52,848 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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:52,848 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,850 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-21 00:02:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 00:02:52,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-21 00:02:52,851 INFO L87 Difference]: Start difference. First operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-21 00:02:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,852 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-21 00:02:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 00:02:52,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:52,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-21 00:02:52,854 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2022-02-21 00:02:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:52,854 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-21 00:02:52,854 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:02:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-21 00:02:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:52,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:52,855 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:52,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 00:02:53,068 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:02:53,069 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2022-02-21 00:02:53,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21788540] [2022-02-21 00:02:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {453#true} is VALID [2022-02-21 00:02:53,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {455#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {455#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#(= |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: L6 {455#(= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(= |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; {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |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: L6 {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |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; {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |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: L6 {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(<= |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; {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#(<= |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: L6 {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(<= |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; {459#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:53,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !(getNumbers_~i~0#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {454#false} is VALID [2022-02-21 00:02:53,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {454#false} is VALID [2022-02-21 00:02:53,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume !!(getNumbers2_~i~1#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#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); {454#false} is VALID [2022-02-21 00:02:53,158 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:02:53,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:53,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21788540] [2022-02-21 00:02:53,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21788540] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:53,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377862811] [2022-02-21 00:02:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:53,162 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:02:53,164 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:02:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 00:02:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:53,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {453#true} is VALID [2022-02-21 00:02:53,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {466#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} assume !!(getNumbers_~i~0#1 < 10); {466#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(<= |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: L6 {466#(<= |ULTIMATE.start_getNumbers_~i~0#1| 0)} is VALID [2022-02-21 00:02:53,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {466#(<= |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; {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} assume !!(getNumbers_~i~0#1 < 10); {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |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: L6 {456#(<= |ULTIMATE.start_getNumbers_~i~0#1| 1)} is VALID [2022-02-21 00:02:53,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |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; {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} assume !!(getNumbers_~i~0#1 < 10); {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |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: L6 {457#(<= |ULTIMATE.start_getNumbers_~i~0#1| 2)} is VALID [2022-02-21 00:02:53,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(<= |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; {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} assume !!(getNumbers_~i~0#1 < 10); {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#(<= |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: L6 {458#(<= |ULTIMATE.start_getNumbers_~i~0#1| 3)} is VALID [2022-02-21 00:02:53,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(<= |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; {459#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} is VALID [2022-02-21 00:02:53,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= |ULTIMATE.start_getNumbers_~i~0#1| 4)} assume !(getNumbers_~i~0#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {454#false} is VALID [2022-02-21 00:02:53,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {454#false} is VALID [2022-02-21 00:02:53,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume !!(getNumbers2_~i~1#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#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); {454#false} is VALID [2022-02-21 00:02:53,329 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:02:53,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:53,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#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); {454#false} is VALID [2022-02-21 00:02:53,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} assume !!(getNumbers2_~i~1#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {454#false} is VALID [2022-02-21 00:02:53,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {454#false} is VALID [2022-02-21 00:02:53,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {530#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} assume !(getNumbers_~i~0#1 < 10); {454#false} is VALID [2022-02-21 00:02:53,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#(< |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; {530#(< |ULTIMATE.start_getNumbers_~i~0#1| 10)} is VALID [2022-02-21 00:02:53,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#(< |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: L6 {534#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:53,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {534#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} assume !!(getNumbers_~i~0#1 < 10); {534#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:53,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(< |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; {534#(< |ULTIMATE.start_getNumbers_~i~0#1| 9)} is VALID [2022-02-21 00:02:53,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(< |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: L6 {544#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:53,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} assume !!(getNumbers_~i~0#1 < 10); {544#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:53,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(< |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; {544#(< |ULTIMATE.start_getNumbers_~i~0#1| 8)} is VALID [2022-02-21 00:02:53,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(< |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: L6 {554#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:02:53,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} assume !!(getNumbers_~i~0#1 < 10); {554#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:02:53,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {564#(< |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; {554#(< |ULTIMATE.start_getNumbers_~i~0#1| 7)} is VALID [2022-02-21 00:02:53,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {564#(< |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: L6 {564#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:53,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} assume !!(getNumbers_~i~0#1 < 10); {564#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:53,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {564#(< |ULTIMATE.start_getNumbers_~i~0#1| 6)} is VALID [2022-02-21 00:02:53,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {453#true} is VALID [2022-02-21 00:02:53,465 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:02:53,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377862811] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:53,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:53,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 00:02:53,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764396035] [2022-02-21 00:02:53,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:53,466 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:02:53,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:53,466 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:02:53,493 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:02:53,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:02:53,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:02:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:53,495 INFO L87 Difference]: Start difference. First operand 34 states and 35 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:02:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,620 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:53,620 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:02:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:53,621 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:02:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:53,622 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:02:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:53,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-02-21 00:02:53,679 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:53,680 INFO L225 Difference]: With dead ends: 52 [2022-02-21 00:02:53,680 INFO L226 Difference]: Without dead ends: 52 [2022-02-21 00:02:53,681 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:02:53,681 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:53,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-21 00:02:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-21 00:02:53,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:53,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:53,685 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:53,685 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,686 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:53,687 INFO L87 Difference]: Start difference. First operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,689 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:53,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-02-21 00:02:53,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 19 [2022-02-21 00:02:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:53,691 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-02-21 00:02:53,691 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:02:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:02:53,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:53,692 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:53,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 00:02:53,907 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:02:53,907 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2022-02-21 00:02:53,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333246758] [2022-02-21 00:02:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:54,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !(getNumbers_~i~0#1 < 10); {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {786#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {787#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:54,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {787#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {788#(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:02:54,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {788#(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); {788#(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:02:54,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {788#(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); {785#false} is VALID [2022-02-21 00:02:54,073 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:02:54,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:54,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333246758] [2022-02-21 00:02:54,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333246758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:54,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:54,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:54,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036843454] [2022-02-21 00:02:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:54,075 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:02:54,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:54,076 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:02:54,084 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:02:54,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:02:54,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:02:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:02:54,085 INFO L87 Difference]: Start difference. First operand 52 states and 53 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:02:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,204 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-21 00:02:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:02:54,205 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:02:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:54,205 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:02:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-21 00:02:54,206 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:02:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-21 00:02:54,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-21 00:02:54,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:54,240 INFO L225 Difference]: With dead ends: 60 [2022-02-21 00:02:54,240 INFO L226 Difference]: Without dead ends: 60 [2022-02-21 00:02:54,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:02:54,241 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:54,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-21 00:02:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-02-21 00:02:54,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:54,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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:54,245 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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:54,245 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,247 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-21 00:02:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-21 00:02:54,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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 60 states. [2022-02-21 00:02:54,248 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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 60 states. [2022-02-21 00:02:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,250 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-02-21 00:02:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-02-21 00:02:54,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:54,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 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:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-02-21 00:02:54,252 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 37 [2022-02-21 00:02:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:54,252 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-02-21 00:02:54,253 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:02:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-21 00:02:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:02:54,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:54,254 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:54,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:54,254 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2022-02-21 00:02:54,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:54,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073565128] [2022-02-21 00:02:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:54,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {1029#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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: L6 {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#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; {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} assume !(getNumbers_~i~0#1 < 10); {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:54,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {1031#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| 1) 1) (= |~#array~0.base| 1))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1032#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= (select |#valid| 1) 1))} is VALID [2022-02-21 00:02:54,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {1032#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= (select |#valid| 1) 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1033#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} is VALID [2022-02-21 00:02:54,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {1033#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} assume !!(getNumbers2_~i~1#1 < 10); {1033#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} is VALID [2022-02-21 00:02:54,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {1033#(= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1)} assume !(1 == #valid[getNumbers2_~numbers~0#1.base]); {1030#false} is VALID [2022-02-21 00:02:54,372 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:02:54,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:54,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073565128] [2022-02-21 00:02:54,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073565128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:54,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:54,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:54,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098318678] [2022-02-21 00:02:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:54,374 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:02:54,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:54,374 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:02:54,382 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:02:54,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:02:54,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:02:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:02:54,384 INFO L87 Difference]: Start difference. First operand 54 states and 56 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:02:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,468 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:02:54,468 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:02:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:54,469 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:02:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 00:02:54,469 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:02:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 00:02:54,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-21 00:02:54,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:54,494 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:54,494 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 00:02:54,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:02:54,496 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:54,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 00:02:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-21 00:02:54,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:54,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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:54,500 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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:54,500 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,501 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:54,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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 53 states. [2022-02-21 00:02:54,502 INFO L87 Difference]: Start difference. First operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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 53 states. [2022-02-21 00:02:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,504 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:54,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:54,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 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:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-02-21 00:02:54,506 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2022-02-21 00:02:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:54,506 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-02-21 00:02:54,507 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:02:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:02:54,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:54,507 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:54,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:54,508 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2022-02-21 00:02:54,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:54,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927861870] [2022-02-21 00:02:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:54,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {1252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1252#true} is VALID [2022-02-21 00:02:54,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1252#true} is VALID [2022-02-21 00:02:54,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {1252#true} assume !!(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {1252#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {1252#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {1252#true} assume !(getNumbers_~i~0#1 < 10); {1252#true} is VALID [2022-02-21 00:02:54,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {1252#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1252#true} is VALID [2022-02-21 00:02:54,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {1252#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 1)} is VALID [2022-02-21 00:02:54,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 1)} assume !!(getNumbers2_~i~1#1 < 10); {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 1)} is VALID [2022-02-21 00:02:54,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 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: L18 {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 1)} is VALID [2022-02-21 00:02:54,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {1254#(= (select |#valid| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|) 1)} assume !(1 == #valid[getNumbers2_~#numbers2~0#1.base]); {1253#false} is VALID [2022-02-21 00:02:54,576 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:02:54,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:54,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927861870] [2022-02-21 00:02:54,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927861870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:54,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:54,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:54,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606995001] [2022-02-21 00:02:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:54,593 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), 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:02:54,600 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:02:54,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:54,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:54,601 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:02:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,627 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:02:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:02:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:54,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-21 00:02:54,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:54,663 INFO L225 Difference]: With dead ends: 52 [2022-02-21 00:02:54,663 INFO L226 Difference]: Without dead ends: 52 [2022-02-21 00:02:54,663 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:02:54,664 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:54,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-21 00:02:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-21 00:02:54,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:54,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:54,667 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:54,668 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,669 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:54,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:54,673 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,674 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-02-21 00:02:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:54,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:54,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-02-21 00:02:54,676 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 38 [2022-02-21 00:02:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:54,676 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-02-21 00:02:54,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:02:54,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:54,677 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:54,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:54,678 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2022-02-21 00:02:54,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:54,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091709929] [2022-02-21 00:02:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:54,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1465#true} is VALID [2022-02-21 00:02:54,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1465#true} is VALID [2022-02-21 00:02:54,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {1465#true} assume !!(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {1465#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1465#true} is VALID [2022-02-21 00:02:54,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {1465#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1465#true} is VALID [2022-02-21 00:02:54,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1465#true} assume !(getNumbers_~i~0#1 < 10); {1465#true} is VALID [2022-02-21 00:02:54,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {1465#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1465#true} is VALID [2022-02-21 00:02:54,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {1465#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:54,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:54,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:54,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {1467#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {1466#false} is VALID [2022-02-21 00:02:54,753 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:02:54,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:54,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091709929] [2022-02-21 00:02:54,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091709929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:54,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:54,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:54,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242257380] [2022-02-21 00:02:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:54,755 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), 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:02:54,767 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:02:54,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:54,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:54,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:54,769 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:02:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,809 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-21 00:02:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:02:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:02:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:02:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:02:54,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 00:02:54,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:54,836 INFO L225 Difference]: With dead ends: 55 [2022-02-21 00:02:54,837 INFO L226 Difference]: Without dead ends: 55 [2022-02-21 00:02:54,837 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:02:54,837 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 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:02:54,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-21 00:02:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-02-21 00:02:54,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:54,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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:54,841 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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:54,841 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,842 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-21 00:02:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-02-21 00:02:54,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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 55 states. [2022-02-21 00:02:54,844 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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 55 states. [2022-02-21 00:02:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,845 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-02-21 00:02:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-02-21 00:02:54,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:54,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:54,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:54,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 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:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-02-21 00:02:54,847 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 38 [2022-02-21 00:02:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:54,847 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-02-21 00:02:54,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:02:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 00:02:54,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:54,848 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:54,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:54,849 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2022-02-21 00:02:54,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:54,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193103381] [2022-02-21 00:02:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:54,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:55,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {1688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !(getNumbers_~i~0#1 < 10); {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:02:55,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {1690#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1691#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {1691#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1692#(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|)) 0))} is VALID [2022-02-21 00:02:55,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {1692#(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|)) 0))} assume !!(getNumbers2_~i~1#1 < 10); {1692#(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|)) 0))} is VALID [2022-02-21 00:02:55,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {1692#(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|)) 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: L18 {1692#(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|)) 0))} is VALID [2022-02-21 00:02:55,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {1692#(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|)) 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {1692#(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|)) 0))} is VALID [2022-02-21 00:02:55,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {1692#(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|)) 0))} havoc getNumbers2_#t~mem3#1; {1692#(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|)) 0))} is VALID [2022-02-21 00:02:55,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {1692#(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|)) 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {1693#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:02:55,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {1693#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} assume !!(getNumbers2_~i~1#1 < 10); {1693#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:02:55,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {1693#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#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); {1689#false} is VALID [2022-02-21 00:02:55,024 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:02:55,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:55,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193103381] [2022-02-21 00:02:55,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193103381] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:55,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329362709] [2022-02-21 00:02:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:55,052 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:02:55,065 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:02:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:55,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 00:02:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:55,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:55,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:02:55,790 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:02:55,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {1688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !(getNumbers_~i~0#1 < 10); {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {1697#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1797#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 1)) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:02:55,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {1797#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 1)) (< 0 |#StackHeapBarrier|))} 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} assume !!(getNumbers2_~i~1#1 < 10); {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 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: L18 {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} havoc getNumbers2_#t~mem3#1; {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:02:55,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {1817#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:02:55,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {1817#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} assume !!(getNumbers2_~i~1#1 < 10); {1817#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:02:55,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {1817#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#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); {1689#false} is VALID [2022-02-21 00:02:55,957 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:02:55,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:58,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {1824#(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); {1689#false} is VALID [2022-02-21 00:02:58,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {1824#(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); {1824#(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:02:58,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {1831#(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; {1824#(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:02:58,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {1831#(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; {1831#(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:02:58,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {1831#(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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {1831#(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:02:58,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {1831#(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: L18 {1831#(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:02:58,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {1831#(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); {1831#(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:02:58,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {1847#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 4)) (forall ((v_ArrVal_173 Int)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {1831#(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:02:58,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {1847#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 4)) (forall ((v_ArrVal_173 Int)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |ULTIMATE.start_getNumbers_#res#1.base|))))))} is VALID [2022-02-21 00:02:58,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#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: L6 {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume !!(getNumbers_~i~0#1 < 10); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {1688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {1851#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11|)) (and (forall ((v_ArrVal_173 Int)) (<= (+ |~#array~0.offset| 8) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_11| v_ArrVal_173) |~#array~0.base|))) (<= 0 (+ |~#array~0.offset| 4)))))} is VALID [2022-02-21 00:02:58,740 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:02:58,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329362709] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:58,741 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:58,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-02-21 00:02:58,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416934096] [2022-02-21 00:02:58,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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:02:58,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:58,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:58,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 00:02:58,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 00:02:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-21 00:02:58,804 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,256 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-21 00:02:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:02:59,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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:02:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-21 00:02:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-21 00:02:59,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-02-21 00:02:59,341 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,341 INFO L225 Difference]: With dead ends: 85 [2022-02-21 00:02:59,342 INFO L226 Difference]: Without dead ends: 85 [2022-02-21 00:02:59,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:02:59,342 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 230 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:59,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 71 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-02-21 00:02:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-21 00:02:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2022-02-21 00:02:59,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:59,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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:02:59,345 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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:02:59,345 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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:02:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,346 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-21 00:02:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-21 00:02:59,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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) Second operand 85 states. [2022-02-21 00:02:59,347 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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) Second operand 85 states. [2022-02-21 00:02:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:59,348 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-21 00:02:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-21 00:02:59,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:59,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:59,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:59,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 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:02:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-02-21 00:02:59,357 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 42 [2022-02-21 00:02:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:59,358 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-02-21 00:02:59,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-02-21 00:02:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 00:02:59,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:59,358 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:59,407 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:02:59,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:59,568 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:02:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2022-02-21 00:02:59,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:59,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22889074] [2022-02-21 00:02:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2282#true} is VALID [2022-02-21 00:02:59,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2282#true} is VALID [2022-02-21 00:02:59,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#true} assume !(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {2282#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2282#true} is VALID [2022-02-21 00:02:59,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {2284#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {2285#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {2283#false} is VALID [2022-02-21 00:02:59,674 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:02:59,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:59,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22889074] [2022-02-21 00:02:59,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22889074] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:59,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864629588] [2022-02-21 00:02:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:59,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:59,692 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:02:59,693 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:02:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 00:02:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:59,870 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:02:59,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:02:59,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:02:59,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#true} assume !(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:02:59,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {2282#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2282#true} is VALID [2022-02-21 00:02:59,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {2391#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:02:59,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {2407#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {2283#false} is VALID [2022-02-21 00:02:59,950 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:02:59,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:00,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {2283#false} is VALID [2022-02-21 00:03:00,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~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: L18 {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} is VALID [2022-02-21 00:03:00,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} assume !!(getNumbers2_~i~1#1 < 10); {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} is VALID [2022-02-21 00:03:00,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~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; {2417#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} is VALID [2022-02-21 00:03:00,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} havoc getNumbers2_#t~mem3#1; {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} is VALID [2022-02-21 00:03:00,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} is VALID [2022-02-21 00:03:00,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~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: L18 {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} is VALID [2022-02-21 00:03:00,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} assume !!(getNumbers2_~i~1#1 < 10); {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {2282#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {2427#(and (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4)) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 8 |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)))} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {2282#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#true} assume !(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {2282#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {2282#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !!(getNumbers_~i~0#1 < 10); {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2282#true} is VALID [2022-02-21 00:03:00,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2282#true} is VALID [2022-02-21 00:03:00,078 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:00,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864629588] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:00,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:00,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-02-21 00:03:00,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657099440] [2022-02-21 00:03:00,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:00,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:00,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:00,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:03:00,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:03:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:03:00,101 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,228 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-21 00:03:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:03:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-21 00:03:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-21 00:03:00,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-02-21 00:03:00,261 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:00,262 INFO L225 Difference]: With dead ends: 70 [2022-02-21 00:03:00,262 INFO L226 Difference]: Without dead ends: 70 [2022-02-21 00:03:00,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 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:00,263 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:00,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-21 00:03:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-02-21 00:03:00,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:00,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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,265 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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,265 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,266 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-21 00:03:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-21 00:03:00,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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 70 states. [2022-02-21 00:03:00,267 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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 70 states. [2022-02-21 00:03:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,267 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-21 00:03:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-21 00:03:00,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:00,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-02-21 00:03:00,269 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 43 [2022-02-21 00:03:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:00,269 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-02-21 00:03:00,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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,269 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-21 00:03:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 00:03:00,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:00,269 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:00,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 00:03:00,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:00,487 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1223382792, now seen corresponding path program 1 times [2022-02-21 00:03:00,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:00,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815599828] [2022-02-21 00:03:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {2824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {2824#true} assume !(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {2824#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2824#true} is VALID [2022-02-21 00:03:00,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {2824#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {2826#(= |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: L18 {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {2826#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {2826#(= |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; {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {2827#(<= |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: L18 {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {2827#(<= |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; {2828#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:00,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {2828#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !(getNumbers2_~i~1#1 < 10); {2825#false} is VALID [2022-02-21 00:03:00,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {2825#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {2825#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {2825#false} assume !(1 == #valid[main_~numbers~1#1.base]); {2825#false} is VALID [2022-02-21 00:03:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:00,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:00,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815599828] [2022-02-21 00:03:00,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815599828] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:00,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581019583] [2022-02-21 00:03:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:00,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:00,542 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:00,543 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:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:03:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:00,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {2824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {2824#true} assume !(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {2824#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2824#true} is VALID [2022-02-21 00:03:00,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {2824#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {2934#(<= |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: L18 {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {2934#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:00,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {2934#(<= |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; {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {2827#(<= |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: L18 {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {2827#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:00,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {2827#(<= |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; {2828#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:00,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {2828#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !(getNumbers2_~i~1#1 < 10); {2825#false} is VALID [2022-02-21 00:03:00,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {2825#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {2825#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {2825#false} assume !(1 == #valid[main_~numbers~1#1.base]); {2825#false} is VALID [2022-02-21 00:03:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:00,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:00,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {2825#false} assume !(1 == #valid[main_~numbers~1#1.base]); {2825#false} is VALID [2022-02-21 00:03:00,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {2825#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {2825#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {2825#false} is VALID [2022-02-21 00:03:00,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {2986#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} assume !(getNumbers2_~i~1#1 < 10); {2825#false} is VALID [2022-02-21 00:03:00,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {2990#(< |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; {2986#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} is VALID [2022-02-21 00:03:00,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} havoc getNumbers2_#t~mem3#1; {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:00,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:00,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {2990#(< |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: L18 {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:00,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} assume !!(getNumbers2_~i~1#1 < 10); {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:00,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {3006#(< |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; {2990#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:00,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} havoc getNumbers2_#t~mem3#1; {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:00,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:00,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {3006#(< |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: L18 {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:00,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} assume !!(getNumbers2_~i~1#1 < 10); {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {2824#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {3006#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {2824#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {2824#true} assume !(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {2824#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {2824#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume !!(getNumbers_~i~0#1 < 10); {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {2824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {2824#true} is VALID [2022-02-21 00:03:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 00:03:00,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581019583] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:00,808 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:00,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-21 00:03:00,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589072853] [2022-02-21 00:03:00,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 49 [2022-02-21 00:03:00,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:00,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:00,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 00:03:00,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 00:03:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:00,833 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,905 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-21 00:03:00,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:03:00,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 49 [2022-02-21 00:03:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-21 00:03:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-02-21 00:03:00,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-02-21 00:03:00,942 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:00,943 INFO L225 Difference]: With dead ends: 78 [2022-02-21 00:03:00,943 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 00:03:00,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 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:00,944 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:00,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 36 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 00:03:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-02-21 00:03:00,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:00,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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,958 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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,961 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,962 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-21 00:03:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-21 00:03:00,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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:00,963 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,963 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-21 00:03:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-21 00:03:00,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:00,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-02-21 00:03:00,965 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 49 [2022-02-21 00:03:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:00,965 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-02-21 00:03:00,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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,965 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-21 00:03:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 00:03:00,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:00,966 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:00,985 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:01,183 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,SelfDestructingSolverStorable10 [2022-02-21 00:03:01,183 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2022-02-21 00:03:01,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:01,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940732125] [2022-02-21 00:03:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:01,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {3433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !!(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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: L6 {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#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; {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} assume !(getNumbers_~i~0#1 < 10); {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} is VALID [2022-02-21 00:03:01,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {3435#(and (<= 1 |#StackHeapBarrier|) (= |~#array~0.offset| 0) (= 40 (select |#length| 1)) (= |~#array~0.base| 1))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3436#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:01,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {3436#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= 40 (select |#length| 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {3437#(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|)) 0))} is VALID [2022-02-21 00:03:01,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {3437#(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|)) 0))} assume !!(getNumbers2_~i~1#1 < 10); {3437#(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|)) 0))} is VALID [2022-02-21 00:03:01,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {3437#(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|)) 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: L18 {3437#(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|)) 0))} is VALID [2022-02-21 00:03:01,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {3437#(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|)) 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3437#(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|)) 0))} is VALID [2022-02-21 00:03:01,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {3437#(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|)) 0))} havoc getNumbers2_#t~mem3#1; {3437#(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|)) 0))} is VALID [2022-02-21 00:03:01,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {3437#(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|)) 0))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:03:01,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} assume !!(getNumbers2_~i~1#1 < 10); {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:03:01,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |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: L18 {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:03:01,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:03:01,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} havoc getNumbers2_#t~mem3#1; {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1))} is VALID [2022-02-21 00:03:01,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {3438#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |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; {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 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: L18 {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} havoc getNumbers2_#t~mem3#1; {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {3439#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 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; {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 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: L18 {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} havoc getNumbers2_#t~mem3#1; {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {3440#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 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; {3441#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {3441#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {3441#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:01,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {3441#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) 0) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |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); {3434#false} is VALID [2022-02-21 00:03:01,429 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:01,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:01,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940732125] [2022-02-21 00:03:01,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940732125] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:01,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694186881] [2022-02-21 00:03:01,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:01,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:01,444 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:01,445 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:01,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:03:01,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:01,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 00:03:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:01,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:03:01,944 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:02,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {3433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} assume !(getNumbers_~i~0#1 < 10); {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {3445#(and (<= 40 (select |#length| 1)) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (< 0 |#StackHeapBarrier|))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3545#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 1)) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:02,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {3545#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 40 (select |#length| 1)) (< 0 |#StackHeapBarrier|))} 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} assume !!(getNumbers2_~i~1#1 < 10); {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 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: L18 {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} havoc getNumbers2_#t~mem3#1; {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {3549#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} assume !!(getNumbers2_~i~1#1 < 10); {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 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: L18 {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} havoc getNumbers2_#t~mem3#1; {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {3565#(and (= (+ (- 1) |ULTIMATE.start_getNumbers2_~i~1#1|) 0) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} assume !!(getNumbers2_~i~1#1 < 10); {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 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: L18 {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} havoc getNumbers2_#t~mem3#1; {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} is VALID [2022-02-21 00:03:02,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {3581#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 40 (select |#length| 1)))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} is VALID [2022-02-21 00:03:02,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} assume !!(getNumbers2_~i~1#1 < 10); {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} is VALID [2022-02-21 00:03:02,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |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: L18 {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} is VALID [2022-02-21 00:03:02,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} is VALID [2022-02-21 00:03:02,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} havoc getNumbers2_#t~mem3#1; {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 3))} is VALID [2022-02-21 00:03:02,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {3597#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |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; {3613#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4))} is VALID [2022-02-21 00:03:02,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {3613#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4))} assume !!(getNumbers2_~i~1#1 < 10); {3613#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4))} is VALID [2022-02-21 00:03:02,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {3613#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| 1)) (= |ULTIMATE.start_getNumbers2_~i~1#1| 4))} 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); {3434#false} is VALID [2022-02-21 00:03:02,273 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:02,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:04,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {3620#(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); {3434#false} is VALID [2022-02-21 00:03:04,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {3620#(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); {3620#(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:04,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {3627#(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; {3620#(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:04,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {3627#(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; {3627#(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:04,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {3627#(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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3627#(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:04,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {3627#(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: L18 {3627#(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:04,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {3627#(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); {3627#(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:04,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {3643#(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; {3627#(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:04,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {3643#(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; {3643#(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:04,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {3643#(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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3643#(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:04,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {3643#(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: L18 {3643#(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:04,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {3643#(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); {3643#(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:04,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {3659#(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; {3643#(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:04,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {3659#(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; {3659#(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:05,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {3659#(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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3659#(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:05,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {3659#(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: L18 {3659#(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:05,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {3659#(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); {3659#(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:05,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {3675#(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; {3659#(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:05,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {3675#(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; {3675#(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:05,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {3675#(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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {3675#(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:05,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {3675#(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: L18 {3675#(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:05,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {3675#(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); {3675#(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:05,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {3691#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 16)) (forall ((v_ArrVal_343 Int)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {3675#(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:05,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {3691#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (<= 0 (+ |ULTIMATE.start_getNumbers_#res#1.offset| 16)) (forall ((v_ArrVal_343 Int)) (<= (+ |ULTIMATE.start_getNumbers_#res#1.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |ULTIMATE.start_getNumbers_#res#1.base|))))))} is VALID [2022-02-21 00:03:05,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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: L6 {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} assume !!(getNumbers_~i~0#1 < 10); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {3433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {3695#(forall ((|v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16|)) (and (forall ((v_ArrVal_343 Int)) (<= (+ |~#array~0.offset| 20) (select (store |#length| |v_ULTIMATE.start_getNumbers2_~#numbers2~0#1.base_16| v_ArrVal_343) |~#array~0.base|))) (<= 0 (+ 16 |~#array~0.offset|)))))} is VALID [2022-02-21 00:03:05,052 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:05,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694186881] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:05,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:05,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-02-21 00:03:05,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310151135] [2022-02-21 00:03:05,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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:05,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:05,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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:05,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:05,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-21 00:03:05,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 00:03:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-02-21 00:03:05,108 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:06,154 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-02-21 00:03:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 00:03:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-02-21 00:03:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-02-21 00:03:06,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2022-02-21 00:03:06,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:06,256 INFO L225 Difference]: With dead ends: 134 [2022-02-21 00:03:06,256 INFO L226 Difference]: Without dead ends: 134 [2022-02-21 00:03:06,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2022-02-21 00:03:06,257 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 309 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:06,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 156 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 308 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-02-21 00:03:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-21 00:03:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 97. [2022-02-21 00:03:06,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:06,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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,260 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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,260 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:06,261 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-02-21 00:03:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2022-02-21 00:03:06,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:06,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:06,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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 134 states. [2022-02-21 00:03:06,262 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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 134 states. [2022-02-21 00:03:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:06,263 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-02-21 00:03:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2022-02-21 00:03:06,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:06,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:06,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:06,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 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,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-02-21 00:03:06,268 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 57 [2022-02-21 00:03:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:06,268 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-02-21 00:03:06,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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,268 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-21 00:03:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 00:03:06,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:06,269 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:06,299 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:06,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:06,484 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2022-02-21 00:03:06,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:06,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863719793] [2022-02-21 00:03:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4315#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {4315#true} assume !!(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {4315#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {4315#true} is VALID [2022-02-21 00:03:06,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {4315#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {4315#true} is VALID [2022-02-21 00:03:06,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {4315#true} assume !(getNumbers_~i~0#1 < 10); {4315#true} is VALID [2022-02-21 00:03:06,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {4315#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4315#true} is VALID [2022-02-21 00:03:06,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {4315#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {4317#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {4318#(and (<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= |ULTIMATE.start_getNumbers2_~i~1#1| 1) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {4319#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 2) (<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {4320#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 3) (<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {4321#(and (<= |ULTIMATE.start_getNumbers2_~i~1#1| 4) (<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|) (= (+ (- 40) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 0) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {4316#false} is VALID [2022-02-21 00:03:06,601 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:06,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:06,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863719793] [2022-02-21 00:03:06,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863719793] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:06,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016643535] [2022-02-21 00:03:06,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:06,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:06,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:06,603 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:06,604 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:06,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 00:03:06,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:06,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:03:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:06,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:06,794 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:06,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4325#(<= |~#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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !!(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {4325#(<= |~#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: L6 {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {4325#(<= |~#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; {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {4325#(<= |~#array~0.offset| 0)} assume !(getNumbers_~i~0#1 < 10); {4325#(<= |~#array~0.offset| 0)} is VALID [2022-02-21 00:03:06,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {4325#(<= |~#array~0.offset| 0)} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4425#(<= |ULTIMATE.start_getNumbers_#res#1.offset| 0)} is VALID [2022-02-21 00:03:06,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {4425#(<= |ULTIMATE.start_getNumbers_#res#1.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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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; {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {4429#(and (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {4493#(and (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {4493#(and (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4497#(and (<= 0 (* |ULTIMATE.start_getNumbers2_~i~1#1| 4)) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} is VALID [2022-02-21 00:03:06,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {4497#(and (<= 0 (* |ULTIMATE.start_getNumbers2_~i~1#1| 4)) (< |ULTIMATE.start_getNumbers2_~i~1#1| 10) (<= 40 (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (= |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 0))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {4316#false} is VALID [2022-02-21 00:03:06,981 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:06,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:08,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {4501#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} assume !(4 + (getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1) <= #length[getNumbers2_~#numbers2~0#1.base] && 0 <= getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1); {4316#false} is VALID [2022-02-21 00:03:08,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {4505#(or (and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.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: L18 {4501#(and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|)))} is VALID [2022-02-21 00:03:08,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} assume !!(getNumbers2_~i~1#1 < 10); {4505#(or (and (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|))) (not (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|))))} is VALID [2022-02-21 00:03:08,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} havoc getNumbers2_#t~mem3#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 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: L18 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} assume !!(getNumbers2_~i~1#1 < 10); {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} havoc getNumbers2_#t~mem3#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 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: L18 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} assume !!(getNumbers2_~i~1#1 < 10); {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} havoc getNumbers2_#t~mem3#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 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: L18 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} assume !!(getNumbers2_~i~1#1 < 10); {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} getNumbers2_#t~pre2#1 := 1 + getNumbers2_~i~1#1;getNumbers2_~i~1#1 := 1 + getNumbers2_~i~1#1;havoc getNumbers2_#t~pre2#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} havoc getNumbers2_#t~mem3#1; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 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: L18 {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} assume !!(getNumbers2_~i~1#1 < 10); {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {4573#(<= 0 (+ (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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {4509#(and (or (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4))) (<= (div |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset| (- 4)) (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))) (or (<= 9 (div (+ (* (- 1) |ULTIMATE.start_getNumbers2_~#numbers2~0#1.offset|) (- 4) (select |#length| |ULTIMATE.start_getNumbers2_~#numbers2~0#1.base|)) 4)) (<= 10 (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)))))} is VALID [2022-02-21 00:03:08,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {4573#(<= 0 (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_getNumbers_#res#1.offset|)) 4) 1))} is VALID [2022-02-21 00:03:08,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {4577#(<= 0 (+ (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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {4577#(<= 0 (+ (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: L6 {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} assume !!(getNumbers_~i~0#1 < 10); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {4577#(<= 0 (+ (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~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {4577#(<= 0 (+ (div (+ (* (- 1) |~#array~0.offset|) (- 5)) 4) 2))} is VALID [2022-02-21 00:03:08,092 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:08,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016643535] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:08,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:08,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-02-21 00:03:08,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380901626] [2022-02-21 00:03:08,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) 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:08,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:08,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.9375) 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:08,135 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:08,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 00:03:08,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 00:03:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:03:08,136 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 17 states, 16 states have (on average 3.9375) 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:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:08,670 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-21 00:03:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) 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:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.9375) 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:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2022-02-21 00:03:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.9375) 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:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2022-02-21 00:03:08,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2022-02-21 00:03:08,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:08,713 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:03:08,713 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:03:08,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 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:08,714 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 168 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:08,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 62 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:03:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:03:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-21 00:03:08,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:08,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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,717 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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,717 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:08,718 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-21 00:03:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-02-21 00:03:08,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:08,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:08,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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 96 states. [2022-02-21 00:03:08,719 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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 96 states. [2022-02-21 00:03:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:08,720 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-02-21 00:03:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-02-21 00:03:08,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:08,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:08,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:08,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 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,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-02-21 00:03:08,722 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 58 [2022-02-21 00:03:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:08,722 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-02-21 00:03:08,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) 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:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-02-21 00:03:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-21 00:03:08,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:08,723 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:08,779 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:08,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:08,924 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 579926520, now seen corresponding path program 2 times [2022-02-21 00:03:08,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:08,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911782337] [2022-02-21 00:03:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {5079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5079#true} is VALID [2022-02-21 00:03:09,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {5079#true} assume !(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {5079#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5079#true} is VALID [2022-02-21 00:03:09,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {5079#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {5081#(= |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: L18 {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {5081#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {5081#(= |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; {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {5082#(<= |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: L18 {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {5082#(<= |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; {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !!(getNumbers2_~i~1#1 < 10); {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {5083#(<= |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: L18 {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} havoc getNumbers2_#t~mem3#1; {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {5083#(<= |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; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {5084#(<= |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: L18 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {5084#(<= |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; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {5085#(<= |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: L18 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {5085#(<= |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; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,019 INFO L290 TraceCheckUtils]: 61: Hoare triple {5086#(<= |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: L18 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,019 INFO L290 TraceCheckUtils]: 62: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {5086#(<= |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; {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !(getNumbers2_~i~1#1 < 10); {5080#false} is VALID [2022-02-21 00:03:09,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {5080#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,020 INFO L290 TraceCheckUtils]: 67: Hoare triple {5080#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {5080#false} assume !(1 == #valid[main_~numbers~1#1.base]); {5080#false} is VALID [2022-02-21 00:03:09,021 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:09,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911782337] [2022-02-21 00:03:09,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911782337] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:09,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056065838] [2022-02-21 00:03:09,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:03:09,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:09,023 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:09,024 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:09,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:03:09,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:09,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 00:03:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:09,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {5079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5079#true} is VALID [2022-02-21 00:03:09,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {5079#true} assume !(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {5079#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5079#true} is VALID [2022-02-21 00:03:09,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {5079#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {5193#(<= |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: L18 {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {5193#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:09,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {5193#(<= |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; {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} assume !!(getNumbers2_~i~1#1 < 10); {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {5082#(<= |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: L18 {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} havoc getNumbers2_#t~mem3#1; {5082#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 1)} is VALID [2022-02-21 00:03:09,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {5082#(<= |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; {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} assume !!(getNumbers2_~i~1#1 < 10); {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {5083#(<= |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: L18 {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} havoc getNumbers2_#t~mem3#1; {5083#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 2)} is VALID [2022-02-21 00:03:09,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {5083#(<= |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; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {5084#(<= |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: L18 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {5084#(<= |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; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {5085#(<= |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: L18 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,372 INFO L290 TraceCheckUtils]: 59: Hoare triple {5085#(<= |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; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {5086#(<= |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: L18 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {5086#(<= |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; {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !(getNumbers2_~i~1#1 < 10); {5080#false} is VALID [2022-02-21 00:03:09,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {5080#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {5080#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {5080#false} assume !(1 == #valid[main_~numbers~1#1.base]); {5080#false} is VALID [2022-02-21 00:03:09,375 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:09,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:03:09,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {5080#false} assume !(1 == #valid[main_~numbers~1#1.base]); {5080#false} is VALID [2022-02-21 00:03:09,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {5080#false} main_#t~ret4#1.base, main_#t~ret4#1.offset := getNumbers2_#res#1.base, getNumbers2_#res#1.offset;assume { :end_inline_getNumbers2 } true;main_~numbers~1#1.base, main_~numbers~1#1.offset := main_#t~ret4#1.base, main_#t~ret4#1.offset;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {5080#false} getNumbers2_#res#1.base, getNumbers2_#res#1.offset := getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset;call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; {5080#false} is VALID [2022-02-21 00:03:09,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {5305#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} assume !(getNumbers2_~i~1#1 < 10); {5080#false} is VALID [2022-02-21 00:03:09,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {5309#(< |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; {5305#(< |ULTIMATE.start_getNumbers2_~i~1#1| 10)} is VALID [2022-02-21 00:03:09,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} havoc getNumbers2_#t~mem3#1; {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:09,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:09,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {5309#(< |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: L18 {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:09,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} assume !!(getNumbers2_~i~1#1 < 10); {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:09,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {5325#(< |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; {5309#(< |ULTIMATE.start_getNumbers2_~i~1#1| 9)} is VALID [2022-02-21 00:03:09,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} havoc getNumbers2_#t~mem3#1; {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:09,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:09,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {5325#(< |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: L18 {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:09,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} assume !!(getNumbers2_~i~1#1 < 10); {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:09,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {5087#(<= |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; {5325#(< |ULTIMATE.start_getNumbers2_~i~1#1| 8)} is VALID [2022-02-21 00:03:09,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} havoc getNumbers2_#t~mem3#1; {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {5087#(<= |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: L18 {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} assume !!(getNumbers2_~i~1#1 < 10); {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {5086#(<= |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; {5087#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 6)} is VALID [2022-02-21 00:03:09,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} havoc getNumbers2_#t~mem3#1; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {5086#(<= |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: L18 {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} assume !!(getNumbers2_~i~1#1 < 10); {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {5085#(<= |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; {5086#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 5)} is VALID [2022-02-21 00:03:09,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} havoc getNumbers2_#t~mem3#1; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {5085#(<= |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: L18 {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} assume !!(getNumbers2_~i~1#1 < 10); {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {5084#(<= |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; {5085#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 4)} is VALID [2022-02-21 00:03:09,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} havoc getNumbers2_#t~mem3#1; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {5084#(<= |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: L18 {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} assume !!(getNumbers2_~i~1#1 < 10); {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {5079#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {5084#(<= |ULTIMATE.start_getNumbers2_~i~1#1| 3)} is VALID [2022-02-21 00:03:09,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {5079#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {5079#true} assume !(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {5079#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {5079#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume !!(getNumbers_~i~0#1 < 10); {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {5079#true} is VALID [2022-02-21 00:03:09,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {5079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5079#true} is VALID [2022-02-21 00:03:09,633 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:09,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056065838] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:03:09,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:03:09,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-21 00:03:09,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801609225] [2022-02-21 00:03:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 69 [2022-02-21 00:03:09,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:03:09,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:03:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:03:09,680 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,783 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-02-21 00:03:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:03:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 69 [2022-02-21 00:03:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-02-21 00:03:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2022-02-21 00:03:09,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2022-02-21 00:03:09,828 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:09,829 INFO L225 Difference]: With dead ends: 96 [2022-02-21 00:03:09,829 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 00:03:09,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 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:09,829 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 66 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 00:03:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-21 00:03:09,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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,831 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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,831 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,832 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-02-21 00:03:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-02-21 00:03:09,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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 96 states. [2022-02-21 00:03:09,833 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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 96 states. [2022-02-21 00:03:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,834 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-02-21 00:03:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-02-21 00:03:09,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 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,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-02-21 00:03:09,836 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 69 [2022-02-21 00:03:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,836 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-02-21 00:03:09,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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,836 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-02-21 00:03:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-21 00:03:09,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,837 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:09,856 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:10,054 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,SelfDestructingSolverStorable13 [2022-02-21 00:03:10,054 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2022-02-21 00:03:10,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:10,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93937697] [2022-02-21 00:03:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:10,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {5886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5886#true} is VALID [2022-02-21 00:03:10,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {5886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {5886#true} is VALID [2022-02-21 00:03:10,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {5886#true} assume !!(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {5886#true} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {5886#true} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {5886#true} assume !(getNumbers_~i~0#1 < 10); {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {5886#true} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {5886#true} is VALID [2022-02-21 00:03:10,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {5886#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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:10,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} assume !!(getNumbers2_~i~1#1 < 10); {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:10,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {5888#(= |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: L18 {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:10,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:10,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} havoc getNumbers2_#t~mem3#1; {5888#(= |ULTIMATE.start_getNumbers2_~i~1#1| 0)} is VALID [2022-02-21 00:03:10,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {5888#(= |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; {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(<= 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: L18 {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5889#(<= 1 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {5889#(<= 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; {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {5890#(<= 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: L18 {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5890#(<= 2 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {5890#(<= 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; {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {5891#(<= 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: L18 {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5891#(<= 3 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {5891#(<= 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; {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {5892#(<= 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: L18 {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5892#(<= 4 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {5892#(<= 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; {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {5893#(<= 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: L18 {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5893#(<= 5 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {5893#(<= 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; {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {5894#(<= 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: L18 {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5894#(<= 6 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {5894#(<= 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; {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {5895#(<= 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: L18 {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5895#(<= 7 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {5895#(<= 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; {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {5896#(<= 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: L18 {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5896#(<= 8 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {5896#(<= 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; {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {5897#(<= 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: L18 {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,203 INFO L290 TraceCheckUtils]: 82: Hoare triple {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,203 INFO L290 TraceCheckUtils]: 83: Hoare triple {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} havoc getNumbers2_#t~mem3#1; {5897#(<= 9 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,203 INFO L290 TraceCheckUtils]: 84: Hoare triple {5897#(<= 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; {5898#(<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|)} is VALID [2022-02-21 00:03:10,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {5898#(<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|)} assume !!(getNumbers2_~i~1#1 < 10); {5887#false} is VALID [2022-02-21 00:03:10,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {5887#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); {5887#false} is VALID [2022-02-21 00:03:10,204 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:10,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:10,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93937697] [2022-02-21 00:03:10,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93937697] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:03:10,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777016837] [2022-02-21 00:03:10,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 00:03:10,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:03:10,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:10,206 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:10,208 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:10,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 00:03:10,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:03:10,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 00:03:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:10,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:03:10,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:03:10,876 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:11,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {5886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#array~0.base, ~#array~0.offset := 1, 0;call #Ultimate.allocInit(40, 1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1.base, main_#t~ret4#1.offset, main_~numbers~1#1.base, main_~numbers~1#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, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~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; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !!(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} SUMMARY for call write~int(getNumbers_~i~0#1, ~#array~0.base, ~#array~0.offset + 4 * getNumbers_~i~0#1, 4); srcloc: L6 {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#t~pre0#1 := 1 + getNumbers_~i~0#1;getNumbers_~i~0#1 := 1 + getNumbers_~i~0#1;havoc getNumbers_#t~pre0#1; {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} assume !(getNumbers_~i~0#1 < 10); {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {5902#(and (<= 40 (select |#length| 1)) (= |~#array~0.base| 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|))} getNumbers_#res#1.base, getNumbers_#res#1.offset := ~#array~0.base, ~#array~0.offset; {6002#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (< 0 |#StackHeapBarrier|))} is VALID [2022-02-21 00:03:11,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {6002#(and (= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (< 0 |#StackHeapBarrier|))} 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;call getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset := #Ultimate.allocOnStack(40);getNumbers2_~i~1#1 := 0; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,550 INFO L290 TraceCheckUtils]: 74: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,551 INFO L290 TraceCheckUtils]: 75: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,553 INFO L290 TraceCheckUtils]: 80: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} assume !!(getNumbers2_~i~1#1 < 10); {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {6006#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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: L18 {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} SUMMARY for call write~int(getNumbers2_#t~mem3#1, getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset + 4 * getNumbers2_~i~1#1, 4); srcloc: L18-1 {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} havoc getNumbers2_#t~mem3#1; {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {6148#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.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; {6158#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|))} is VALID [2022-02-21 00:03:11,556 INFO L290 TraceCheckUtils]: 85: Hoare triple {6158#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= (+ (div |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| (- 4)) 1) |ULTIMATE.start_getNumbers2_~i~1#1|))} assume !!(getNumbers2_~i~1#1 < 10); {6162#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (< |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|))} is VALID [2022-02-21 00:03:11,556 INFO L290 TraceCheckUtils]: 86: Hoare triple {6162#(and (= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 40 (select |#length| 1)) (< |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|))} 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); {5887#false} is VALID [2022-02-21 00:03:11,557 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:11,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:03:11,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777016837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:11,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:03:11,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2022-02-21 00:03:11,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789825776] [2022-02-21 00:03:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:11,558 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:11,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:11,559 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:11,574 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:11,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:03:11,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:03:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:03:11,575 INFO L87 Difference]: Start difference. First operand 96 states and 97 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:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,745 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-02-21 00:03:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:03:11,745 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:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:11,745 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:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-02-21 00:03:11,746 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:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-02-21 00:03:11,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2022-02-21 00:03:11,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:11,769 INFO L225 Difference]: With dead ends: 95 [2022-02-21 00:03:11,769 INFO L226 Difference]: Without dead ends: 95 [2022-02-21 00:03:11,770 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:11,770 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:11,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-21 00:03:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-02-21 00:03:11,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:11,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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,772 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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,772 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,773 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-02-21 00:03:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-02-21 00:03:11,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 states. [2022-02-21 00:03:11,773 INFO L87 Difference]: Start difference. First operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 states. [2022-02-21 00:03:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,775 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-02-21 00:03:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-02-21 00:03:11,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:11,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 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,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-02-21 00:03:11,776 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2022-02-21 00:03:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:11,777 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-02-21 00:03:11,777 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:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-02-21 00:03:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-21 00:03:11,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:11,777 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:11,796 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:11,987 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,SelfDestructingSolverStorable14 [2022-02-21 00:03:11,987 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2022-02-21 00:03:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1572522744, now seen corresponding path program 3 times [2022-02-21 00:03:11,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:11,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531953442] [2022-02-21 00:03:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:12,058 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:03:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:12,118 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:03:12,118 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:03:12,119 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (8 of 9 remaining) [2022-02-21 00:03:12,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (7 of 9 remaining) [2022-02-21 00:03:12,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (6 of 9 remaining) [2022-02-21 00:03:12,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (5 of 9 remaining) [2022-02-21 00:03:12,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 9 remaining) [2022-02-21 00:03:12,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 9 remaining) [2022-02-21 00:03:12,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 9 remaining) [2022-02-21 00:03:12,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (1 of 9 remaining) [2022-02-21 00:03:12,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-02-21 00:03:12,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:03:12,123 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:12,125 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:12,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:12 BoogieIcfgContainer [2022-02-21 00:03:12,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:12,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:12,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:12,201 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:12,201 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:50" (3/4) ... [2022-02-21 00:03:12,202 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:03:12,257 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:12,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:12,258 INFO L158 Benchmark]: Toolchain (without parser) took 22204.25ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 55.7MB in the beginning and 70.4MB in the end (delta: -14.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,258 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:12,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 56.0MB in the end (delta: -428.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.83ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 54.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,259 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 53.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,259 INFO L158 Benchmark]: RCFGBuilder took 331.55ms. Allocated memory is still 79.7MB. Free memory was 52.9MB in the beginning and 40.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,260 INFO L158 Benchmark]: TraceAbstraction took 21534.77ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 40.0MB in the beginning and 80.9MB in the end (delta: -40.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,260 INFO L158 Benchmark]: Witness Printer took 56.82ms. Allocated memory is still 172.0MB. Free memory was 80.9MB in the beginning and 70.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:03:12,263 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.16ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.91ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 56.0MB in the end (delta: -428.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.83ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 54.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 53.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.55ms. Allocated memory is still 79.7MB. Free memory was 52.9MB in the beginning and 40.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21534.77ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 40.0MB in the beginning and 80.9MB in the end (delta: -40.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 56.82ms. Allocated memory is still 172.0MB. Free memory was 80.9MB in the beginning and 70.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [array={1:0}] [L25] CALL, EXPR getNumbers2() [L13] CALL, EXPR getNumbers() [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}, i=0] [L6] array[i] = i VAL [array={1:0}, i=0] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}, i=1] [L6] array[i] = i VAL [array={1:0}, i=1] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}, i=2] [L6] array[i] = i VAL [array={1:0}, i=2] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}, i=3] [L6] array[i] = i VAL [array={1:0}, i=3] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}, i=4] [L6] array[i] = i VAL [array={1:0}, i=4] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}, i=5] [L6] array[i] = i VAL [array={1:0}, i=5] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}, i=6] [L6] array[i] = i VAL [array={1:0}, i=6] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}, i=7] [L6] array[i] = i VAL [array={1:0}, i=7] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}, i=8] [L6] array[i] = i VAL [array={1:0}, i=8] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}, i=9] [L6] array[i] = i VAL [array={1:0}, i=9] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={1:0}, i=10] [L9] return array; VAL [\result={1:0}, array={1:0}, i=10] [L13] RET, EXPR getNumbers() [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L17] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L17] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L17] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L17] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L17] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L17] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L17] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L17] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L17] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L17] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L17] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={1:0}, i=10, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - UnprovableResult [Line: 6]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 24]: 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, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1113 mSDsluCounter, 792 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 991 IncrementalHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 242 mSDtfsCounter, 991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 710 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=12, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1109 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1332 ConstructedInterpolants, 68 QuantifiedInterpolants, 10948 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 3996/4561 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:12,319 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)