./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:29,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:29,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:29,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:29,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:29,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:29,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:29,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:29,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:29,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:29,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:29,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:29,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:29,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:29,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:29,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:29,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:29,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:29,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:29,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:29,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:29,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:29,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:29,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:29,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:29,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:29,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:29,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:29,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:29,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:29,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:29,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:29,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:29,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:29,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:29,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:29,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:29,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:29,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:29,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:29,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:29,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:29,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:29,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:29,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:29,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:29,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:29,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:29,868 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:29,868 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:29,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:29,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:29,870 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:29,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:29,871 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:29,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:29,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:29,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:29,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:29,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:29,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:29,872 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:29,872 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2022-02-21 03:36:30,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:30,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:30,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:30,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:30,112 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:30,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-02-21 03:36:30,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc599e476/ebaf7b8668a5482585abbdbe3b9ea87c/FLAGba42db064 [2022-02-21 03:36:30,471 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:30,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-02-21 03:36:30,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc599e476/ebaf7b8668a5482585abbdbe3b9ea87c/FLAGba42db064 [2022-02-21 03:36:30,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc599e476/ebaf7b8668a5482585abbdbe3b9ea87c [2022-02-21 03:36:30,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:30,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:30,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:30,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:30,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:30,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:30" (1/1) ... [2022-02-21 03:36:30,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aef0d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:30, skipping insertion in model container [2022-02-21 03:36:30,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:30" (1/1) ... [2022-02-21 03:36:30,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:30,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:31,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-02-21 03:36:31,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:31,244 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:31,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-02-21 03:36:31,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:31,292 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:31,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31 WrapperNode [2022-02-21 03:36:31,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:31,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:31,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:31,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:31,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,367 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-21 03:36:31,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:31,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:31,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:31,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:31,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:31,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:31,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:31,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:31,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (1/1) ... [2022-02-21 03:36:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:31,552 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:31,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:31,681 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:31,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:31,686 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:36:31,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:31 BoogieIcfgContainer [2022-02-21 03:36:31,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:31,691 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:31,691 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:31,694 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:31,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:31,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:30" (1/3) ... [2022-02-21 03:36:31,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413f0669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:31, skipping insertion in model container [2022-02-21 03:36:31,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:31,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:31" (2/3) ... [2022-02-21 03:36:31,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413f0669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:31, skipping insertion in model container [2022-02-21 03:36:31,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:31,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:31" (3/3) ... [2022-02-21 03:36:31,700 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-02-21 03:36:31,741 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:31,741 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:31,741 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:31,741 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:31,741 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:31,741 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:31,741 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:31,742 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:31,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:31,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:31,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:31,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:31,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:31,777 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:31,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:31,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:31,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:31,780 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:31,780 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:31,787 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L20-3true [2022-02-21 03:36:31,789 INFO L793 eck$LassoCheckResult]: Loop: 13#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 16#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 14#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 13#L20-3true [2022-02-21 03:36:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:31,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651450545] [2022-02-21 03:36:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,079 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-02-21 03:36:32,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400935233] [2022-02-21 03:36:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,133 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-02-21 03:36:32,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070465434] [2022-02-21 03:36:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,176 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,524 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:32,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:32,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:32,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:32,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:32,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:32,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:32,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:32,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-02-21 03:36:32,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:32,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:32,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:33,099 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:33,102 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:33,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:33,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:33,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:36:33,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:33,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:33,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:33,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:33,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:33,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:33,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:33,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:33,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:33,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:33,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:33,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:33,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:33,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:33,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:36:33,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:33,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:33,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:33,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:33,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:33,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:33,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:33,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,594 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:33,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:33,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:33,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:33,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:33,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:33,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:33,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:33,625 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:33,661 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-02-21 03:36:33,661 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-02-21 03:36:33,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:33,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:33,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:33,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:33,696 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:33,697 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-02-21 03:36:33,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:33,756 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:36:33,761 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_~i~0#1 := 2 + main_~i~0#1;" [2022-02-21 03:36:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:33,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {26#unseeded} is VALID [2022-02-21 03:36:33,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {26#unseeded} is VALID [2022-02-21 03:36:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:33,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {102#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:33,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))) (< |ULTIMATE.start_main_~i~0#1| 100000))} assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {102#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:33,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))) (< |ULTIMATE.start_main_~i~0#1| 100000))} main_~i~0#1 := 2 + main_~i~0#1; {94#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* 25000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))))} is VALID [2022-02-21 03:36:33,883 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 03:36:33,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:33,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:33,912 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 45 transitions. Complement of second has 8 states. [2022-02-21 03:36:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:33,955 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:33,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:33,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:33,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:33,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:33,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:33,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:33,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2022-02-21 03:36:33,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:33,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:33,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:33,963 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:36:33,965 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:36:33,965 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:33,967 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:33,967 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:33,967 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:36:33,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:36:33,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:36:33,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:36:33,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:33,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:33,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:33,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:33,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:33,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:33,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:33,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:33,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:33,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:33,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:33,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:33,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:33,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,991 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 03:36:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:36:33,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:33,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:33,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:33,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:33,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:34,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 13 states and 18 transitions. [2022-02-21 03:36:34,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:36:34,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:36:34,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 03:36:34,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:34,001 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:36:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 03:36:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:36:34,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:34,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,018 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,020 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,022 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:36:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:36:34,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:36:34,023 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:36:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,024 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:36:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:36:34,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:34,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:36:34,026 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:36:34,026 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:36:34,026 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:34,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:36:34,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:34,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:34,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:34,027 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:34,027 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:34,027 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 160#L20-3 assume !(main_~i~0#1 < 100000); 161#L20-4 main_~i~0#1 := 0; 157#L26-3 [2022-02-21 03:36:34,028 INFO L793 eck$LassoCheckResult]: Loop: 157#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 163#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 156#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 157#L26-3 [2022-02-21 03:36:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-02-21 03:36:34,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101484228] [2022-02-21 03:36:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {193#true} is VALID [2022-02-21 03:36:34,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {195#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {194#false} is VALID [2022-02-21 03:36:34,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#false} main_~i~0#1 := 0; {194#false} is VALID [2022-02-21 03:36:34,061 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 03:36:34,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:34,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101484228] [2022-02-21 03:36:34,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101484228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:34,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:34,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:34,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211237457] [2022-02-21 03:36:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,064 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-02-21 03:36:34,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421952289] [2022-02-21 03:36:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,074 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:34,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:34,109 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 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 03:36:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,136 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 03:36:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 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 03:36:34,139 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 03:36:34,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-02-21 03:36:34,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:34,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 24 transitions. [2022-02-21 03:36:34,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:36:34,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:36:34,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-02-21 03:36:34,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:34,143 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 03:36:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-02-21 03:36:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2022-02-21 03:36:34,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:34,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,144 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,144 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,145 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 03:36:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 03:36:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 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 19 states and 24 transitions. [2022-02-21 03:36:34,146 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 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 19 states and 24 transitions. [2022-02-21 03:36:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,147 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 03:36:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 03:36:34,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:34,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:36:34,148 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:36:34,148 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:36:34,148 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:34,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:36:34,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:34,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:34,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:34,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:34,150 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:34,150 INFO L791 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 225#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 226#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 229#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 227#L20-3 assume !(main_~i~0#1 < 100000); 228#L20-4 main_~i~0#1 := 0; 224#L26-3 [2022-02-21 03:36:34,150 INFO L793 eck$LassoCheckResult]: Loop: 224#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 230#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 223#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 224#L26-3 [2022-02-21 03:36:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-02-21 03:36:34,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576904258] [2022-02-21 03:36:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {272#true} is VALID [2022-02-21 03:36:34,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {274#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {274#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {274#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {274#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {274#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {275#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {273#false} is VALID [2022-02-21 03:36:34,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {273#false} main_~i~0#1 := 0; {273#false} is VALID [2022-02-21 03:36:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:34,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:34,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576904258] [2022-02-21 03:36:34,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576904258] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:34,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135664094] [2022-02-21 03:36:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:34,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:34,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:34,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:36:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:36:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:34,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {272#true} is VALID [2022-02-21 03:36:34,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {282#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {275#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {273#false} is VALID [2022-02-21 03:36:34,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {273#false} main_~i~0#1 := 0; {273#false} is VALID [2022-02-21 03:36:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:34,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:34,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {273#false} main_~i~0#1 := 0; {273#false} is VALID [2022-02-21 03:36:34,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {273#false} is VALID [2022-02-21 03:36:34,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {301#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:34,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {305#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {272#true} is VALID [2022-02-21 03:36:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:34,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135664094] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:34,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:34,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:36:34,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873945186] [2022-02-21 03:36:34,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,360 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-02-21 03:36:34,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463366626] [2022-02-21 03:36:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,367 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:34,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:34,400 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,478 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-21 03:36:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:36:34,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:34,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-02-21 03:36:34,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:34,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2022-02-21 03:36:34,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:36:34,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:36:34,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-02-21 03:36:34,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:34,495 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-02-21 03:36:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-02-21 03:36:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-02-21 03:36:34,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:34,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 46 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,496 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 46 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,496 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,498 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-21 03:36:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-21 03:36:34,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 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 37 states and 46 transitions. [2022-02-21 03:36:34,498 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 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 37 states and 46 transitions. [2022-02-21 03:36:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,500 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-21 03:36:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-21 03:36:34,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:34,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 03:36:34,501 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:36:34,501 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:36:34,501 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:34,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:36:34,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:34,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:34,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:34,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-02-21 03:36:34,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:34,503 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 362#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 363#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 360#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 361#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 364#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 366#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 374#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 373#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 372#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 371#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 369#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 370#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 368#L20-3 assume !(main_~i~0#1 < 100000); 367#L20-4 main_~i~0#1 := 0; 359#L26-3 [2022-02-21 03:36:34,503 INFO L793 eck$LassoCheckResult]: Loop: 359#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 365#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 358#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 359#L26-3 [2022-02-21 03:36:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-02-21 03:36:34,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939448181] [2022-02-21 03:36:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {452#true} is VALID [2022-02-21 03:36:34,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {454#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {454#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {454#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < 100000); {453#false} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {453#false} main_~i~0#1 := 0; {453#false} is VALID [2022-02-21 03:36:34,564 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 03:36:34,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:34,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939448181] [2022-02-21 03:36:34,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939448181] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:34,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748585146] [2022-02-21 03:36:34,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:34,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:34,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:34,567 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:34,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:36:34,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:34,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:34,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:34,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {452#true} is VALID [2022-02-21 03:36:34,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:34,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < 100000); {453#false} is VALID [2022-02-21 03:36:34,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {453#false} main_~i~0#1 := 0; {453#false} is VALID [2022-02-21 03:36:34,726 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 03:36:34,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:34,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {453#false} main_~i~0#1 := 0; {453#false} is VALID [2022-02-21 03:36:34,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {453#false} is VALID [2022-02-21 03:36:34,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {511#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:34,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {515#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {525#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {535#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {545#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {452#true} is VALID [2022-02-21 03:36:34,861 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 03:36:34,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748585146] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:34,861 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:34,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:36:34,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149264990] [2022-02-21 03:36:34,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,862 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-02-21 03:36:34,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290284066] [2022-02-21 03:36:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,880 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,888 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:34,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:36:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:36:34,946 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 03:36:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,209 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-02-21 03:36:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:35,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 03:36:35,237 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 03:36:35,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2022-02-21 03:36:35,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:35,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2022-02-21 03:36:35,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-02-21 03:36:35,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-02-21 03:36:35,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2022-02-21 03:36:35,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:35,248 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-02-21 03:36:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2022-02-21 03:36:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2022-02-21 03:36:35,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:35,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states and 106 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states and 106 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,253 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,255 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-02-21 03:36:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-02-21 03:36:35,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 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 and 106 transitions. [2022-02-21 03:36:35,256 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 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 and 106 transitions. [2022-02-21 03:36:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,262 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-02-21 03:36:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-02-21 03:36:35,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:35,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-02-21 03:36:35,267 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 03:36:35,267 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 03:36:35,267 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:35,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-02-21 03:36:35,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:35,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:35,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:35,268 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-02-21 03:36:35,268 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:35,269 INFO L791 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 648#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 649#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 655#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 650#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 651#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 652#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 653#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 680#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 679#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 678#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 677#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 676#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 675#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 674#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 673#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 672#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 671#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 670#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 669#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 668#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 667#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 666#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 665#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 664#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 663#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 662#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 661#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 660#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 658#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 659#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 657#L20-3 assume !(main_~i~0#1 < 100000); 656#L20-4 main_~i~0#1 := 0; 647#L26-3 [2022-02-21 03:36:35,269 INFO L793 eck$LassoCheckResult]: Loop: 647#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 654#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 646#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 647#L26-3 [2022-02-21 03:36:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-02-21 03:36:35,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730716686] [2022-02-21 03:36:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {854#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {854#true} is VALID [2022-02-21 03:36:35,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {856#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {856#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {856#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:35,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~i~0#1 < 100000); {855#false} is VALID [2022-02-21 03:36:35,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {855#false} main_~i~0#1 := 0; {855#false} is VALID [2022-02-21 03:36:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:35,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:35,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730716686] [2022-02-21 03:36:35,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730716686] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:35,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212818650] [2022-02-21 03:36:35,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:35,485 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:35,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:36:35,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:36:35,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:35,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:36:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:35,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {854#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {854#true} is VALID [2022-02-21 03:36:35,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {873#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:35,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(main_~i~0#1 < 100000); {855#false} is VALID [2022-02-21 03:36:35,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {855#false} main_~i~0#1 := 0; {855#false} is VALID [2022-02-21 03:36:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:35,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:36,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {855#false} main_~i~0#1 := 0; {855#false} is VALID [2022-02-21 03:36:36,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {973#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {855#false} is VALID [2022-02-21 03:36:36,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {973#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:36,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:36,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:36,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {977#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:36,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:36,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:36,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {987#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:36,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:36,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:36,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {997#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:36,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:36,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:36,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_~i~0#1 := 2 + main_~i~0#1; {1007#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:36,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:36,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:36,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_~i~0#1 := 2 + main_~i~0#1; {1017#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:36,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:36,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:36,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_~i~0#1 := 2 + main_~i~0#1; {1027#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:36,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:36,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:36,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_~i~0#1 := 2 + main_~i~0#1; {1037#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:36,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:36,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:36,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_~i~0#1 := 2 + main_~i~0#1; {1047#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:36,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:36,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:36,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_~i~0#1 := 2 + main_~i~0#1; {1057#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:36,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:36,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:36,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1067#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:36,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {854#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {854#true} is VALID [2022-02-21 03:36:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:36,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212818650] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:36,236 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:36,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:36:36,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648461633] [2022-02-21 03:36:36,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:36,239 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-02-21 03:36:36,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:36,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322125240] [2022-02-21 03:36:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:36,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:36,273 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:36,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:36:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:36:36,329 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:36,939 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-02-21 03:36:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:36:36,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:36,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:36,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2022-02-21 03:36:37,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:37,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2022-02-21 03:36:37,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-02-21 03:36:37,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-02-21 03:36:37,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2022-02-21 03:36:37,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:37,006 INFO L681 BuchiCegarLoop]: Abstraction has 181 states and 226 transitions. [2022-02-21 03:36:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2022-02-21 03:36:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2022-02-21 03:36:37,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:37,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states and 226 transitions. Second operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states and 226 transitions. Second operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:37,010 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:37,013 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-02-21 03:36:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2022-02-21 03:36:37,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:37,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:37,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 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 181 states and 226 transitions. [2022-02-21 03:36:37,014 INFO L87 Difference]: Start difference. First operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 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 181 states and 226 transitions. [2022-02-21 03:36:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:37,018 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-02-21 03:36:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2022-02-21 03:36:37,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:37,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:37,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:37,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2022-02-21 03:36:37,021 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-02-21 03:36:37,021 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-02-21 03:36:37,021 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:37,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2022-02-21 03:36:37,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:37,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:37,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:37,028 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-02-21 03:36:37,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:37,028 INFO L791 eck$LassoCheckResult]: Stem: 1260#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1266#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1334#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1268#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1269#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1270#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1271#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1333#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1332#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1331#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1330#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1329#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1328#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1327#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1326#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1325#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1324#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1323#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1322#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1320#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1319#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1318#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1317#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1316#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1315#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1314#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1313#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1312#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1311#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1310#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1309#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1308#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1307#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1306#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1305#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1304#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1303#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1302#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1301#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1300#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1299#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1298#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1297#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1296#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1295#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1294#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1293#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1292#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1291#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1290#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1289#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1288#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1287#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1286#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1284#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1283#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1282#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1281#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1280#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1279#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1277#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1275#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1276#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1274#L20-3 assume !(main_~i~0#1 < 100000); 1273#L20-4 main_~i~0#1 := 0; 1265#L26-3 [2022-02-21 03:36:37,028 INFO L793 eck$LassoCheckResult]: Loop: 1265#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1272#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1264#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1265#L26-3 [2022-02-21 03:36:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-02-21 03:36:37,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:37,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857554094] [2022-02-21 03:36:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:37,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1700#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {1700#true} is VALID [2022-02-21 03:36:37,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1700#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {1724#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:37,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {1724#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(main_~i~0#1 < 100000); {1701#false} is VALID [2022-02-21 03:36:37,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {1701#false} main_~i~0#1 := 0; {1701#false} is VALID [2022-02-21 03:36:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:37,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:37,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857554094] [2022-02-21 03:36:37,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857554094] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:37,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597177612] [2022-02-21 03:36:37,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:36:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:37,443 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:37,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:36:37,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:36:37,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:37,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:36:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:37,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:37,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1700#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {1700#true} is VALID [2022-02-21 03:36:37,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {1700#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {1731#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:37,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:37,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:37,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:37,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:37,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:37,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:37,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:37,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:37,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:37,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:37,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:37,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:37,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:37,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:37,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:37,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:37,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:37,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {1724#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:37,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {1724#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(main_~i~0#1 < 100000); {1701#false} is VALID [2022-02-21 03:36:37,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {1701#false} main_~i~0#1 := 0; {1701#false} is VALID [2022-02-21 03:36:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:37,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:38,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {1701#false} main_~i~0#1 := 0; {1701#false} is VALID [2022-02-21 03:36:38,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {1939#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1701#false} is VALID [2022-02-21 03:36:38,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {1939#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:38,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:38,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:38,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {1943#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:38,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:38,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:38,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {1953#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:38,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:38,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:38,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {1963#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:38,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:38,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:38,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_~i~0#1 := 2 + main_~i~0#1; {1973#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:38,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:38,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:38,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_~i~0#1 := 2 + main_~i~0#1; {1983#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:38,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:38,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:38,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_~i~0#1 := 2 + main_~i~0#1; {1993#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:38,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:38,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:38,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_~i~0#1 := 2 + main_~i~0#1; {2003#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:38,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:38,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:38,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_~i~0#1 := 2 + main_~i~0#1; {2013#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:38,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:38,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:38,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_~i~0#1 := 2 + main_~i~0#1; {2023#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:38,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:38,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:38,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_~i~0#1 := 2 + main_~i~0#1; {2033#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:38,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:38,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:38,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} main_~i~0#1 := 2 + main_~i~0#1; {2043#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:38,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:36:38,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:36:38,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} main_~i~0#1 := 2 + main_~i~0#1; {2053#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:36:38,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:36:38,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:36:38,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} main_~i~0#1 := 2 + main_~i~0#1; {2063#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:36:38,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:36:38,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:36:38,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} main_~i~0#1 := 2 + main_~i~0#1; {2073#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:36:38,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:36:38,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:36:38,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} main_~i~0#1 := 2 + main_~i~0#1; {2083#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:36:38,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:36:38,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:36:38,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} main_~i~0#1 := 2 + main_~i~0#1; {2093#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:36:38,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:36:38,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:36:38,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} main_~i~0#1 := 2 + main_~i~0#1; {2103#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:36:38,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:36:38,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:36:38,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} main_~i~0#1 := 2 + main_~i~0#1; {2113#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:36:38,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:36:38,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:36:38,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} main_~i~0#1 := 2 + main_~i~0#1; {2123#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:36:38,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:36:38,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:36:38,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} main_~i~0#1 := 2 + main_~i~0#1; {2133#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:36:38,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:36:38,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:36:38,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} main_~i~0#1 := 2 + main_~i~0#1; {2143#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:36:38,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:36:38,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:36:38,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1700#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {2153#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:36:38,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {1700#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {1700#true} is VALID [2022-02-21 03:36:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:38,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597177612] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:38,945 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:38,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-21 03:36:38,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945809161] [2022-02-21 03:36:38,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:38,946 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-02-21 03:36:38,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:38,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421448955] [2022-02-21 03:36:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:38,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:38,953 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:38,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-21 03:36:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-21 03:36:38,992 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,239 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-02-21 03:36:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:36:40,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:40,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2022-02-21 03:36:40,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:40,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2022-02-21 03:36:40,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2022-02-21 03:36:40,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-02-21 03:36:40,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2022-02-21 03:36:40,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:40,351 INFO L681 BuchiCegarLoop]: Abstraction has 373 states and 466 transitions. [2022-02-21 03:36:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2022-02-21 03:36:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2022-02-21 03:36:40,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:40,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states and 466 transitions. Second operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,355 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states and 466 transitions. Second operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,356 INFO L87 Difference]: Start difference. First operand 373 states and 466 transitions. Second operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,373 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-02-21 03:36:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 466 transitions. [2022-02-21 03:36:40,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:40,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:40,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 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 373 states and 466 transitions. [2022-02-21 03:36:40,374 INFO L87 Difference]: Start difference. First operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 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 373 states and 466 transitions. [2022-02-21 03:36:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,383 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-02-21 03:36:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 466 transitions. [2022-02-21 03:36:40,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:40,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:40,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:40,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2022-02-21 03:36:40,386 INFO L704 BuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-02-21 03:36:40,386 INFO L587 BuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-02-21 03:36:40,386 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:40,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2022-02-21 03:36:40,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:40,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:40,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:40,388 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-02-21 03:36:40,388 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:40,388 INFO L791 eck$LassoCheckResult]: Stem: 2538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 2539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 2544#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2545#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2684#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2546#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2547#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2548#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2549#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2683#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2682#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2681#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2680#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2679#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2678#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2677#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2676#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2675#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2674#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2673#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2672#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2671#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2670#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2669#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2668#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2667#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2666#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2665#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2664#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2663#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2662#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2661#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2660#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2659#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2658#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2657#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2656#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2655#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2654#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2653#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2652#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2651#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2650#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2649#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2648#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2647#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2646#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2645#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2644#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2643#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2642#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2641#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2640#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2639#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2638#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2637#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2636#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2635#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2634#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2633#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2632#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2631#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2630#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2629#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2628#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2627#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2626#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2625#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2624#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2623#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2622#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2620#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2619#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2618#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2617#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2616#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2615#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2614#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2613#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2612#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2611#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2610#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2609#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2608#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2607#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2606#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2605#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2604#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2603#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2602#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2601#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2600#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2599#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2598#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2597#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2596#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2595#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2594#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2593#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2592#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2591#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2590#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2589#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2587#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2586#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2585#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2584#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2583#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2582#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2581#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2580#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2579#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2578#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2577#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2576#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2575#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2574#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2573#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2572#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2571#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2570#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2569#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2568#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2567#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2566#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2565#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2564#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2563#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2562#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2561#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2560#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2559#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2558#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2557#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2556#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2555#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2553#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2554#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2552#L20-3 assume !(main_~i~0#1 < 100000); 2551#L20-4 main_~i~0#1 := 0; 2543#L26-3 [2022-02-21 03:36:40,391 INFO L793 eck$LassoCheckResult]: Loop: 2543#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2550#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2542#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2543#L26-3 [2022-02-21 03:36:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-02-21 03:36:40,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:40,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825878959] [2022-02-21 03:36:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:41,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {3434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {3434#true} is VALID [2022-02-21 03:36:41,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {3436#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:41,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:41,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:41,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:41,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:41,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:41,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:41,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:41,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:41,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:41,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:41,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:41,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:41,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:41,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:41,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:41,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:41,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:41,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:41,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:41,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:41,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:41,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:41,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:41,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:41,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:41,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:41,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:41,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:41,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:41,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:41,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:41,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:41,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:41,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:41,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:41,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:41,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:41,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:41,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:41,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:41,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:41,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:41,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:41,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:41,551 INFO L290 TraceCheckUtils]: 59: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:41,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:41,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:41,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:41,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:41,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:41,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:41,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:41,559 INFO L290 TraceCheckUtils]: 67: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:41,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:41,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:41,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_~i~0#1 := 2 + main_~i~0#1; {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:41,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:41,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:41,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_~i~0#1 := 2 + main_~i~0#1; {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:36:41,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:36:41,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:36:41,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_~i~0#1 := 2 + main_~i~0#1; {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:36:41,563 INFO L290 TraceCheckUtils]: 77: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:36:41,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:36:41,563 INFO L290 TraceCheckUtils]: 79: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_~i~0#1 := 2 + main_~i~0#1; {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:36:41,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:36:41,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:36:41,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_~i~0#1 := 2 + main_~i~0#1; {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:36:41,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:36:41,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:36:41,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_~i~0#1 := 2 + main_~i~0#1; {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:36:41,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:36:41,574 INFO L290 TraceCheckUtils]: 87: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:36:41,574 INFO L290 TraceCheckUtils]: 88: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_~i~0#1 := 2 + main_~i~0#1; {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:36:41,575 INFO L290 TraceCheckUtils]: 89: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:36:41,575 INFO L290 TraceCheckUtils]: 90: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:36:41,584 INFO L290 TraceCheckUtils]: 91: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_~i~0#1 := 2 + main_~i~0#1; {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:36:41,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:36:41,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:36:41,585 INFO L290 TraceCheckUtils]: 94: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_~i~0#1 := 2 + main_~i~0#1; {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:36:41,585 INFO L290 TraceCheckUtils]: 95: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:36:41,586 INFO L290 TraceCheckUtils]: 96: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:36:41,586 INFO L290 TraceCheckUtils]: 97: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_~i~0#1 := 2 + main_~i~0#1; {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:36:41,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:36:41,586 INFO L290 TraceCheckUtils]: 99: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:36:41,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_~i~0#1 := 2 + main_~i~0#1; {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:36:41,587 INFO L290 TraceCheckUtils]: 101: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:36:41,587 INFO L290 TraceCheckUtils]: 102: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:36:41,588 INFO L290 TraceCheckUtils]: 103: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_~i~0#1 := 2 + main_~i~0#1; {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:36:41,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:36:41,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:36:41,588 INFO L290 TraceCheckUtils]: 106: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_~i~0#1 := 2 + main_~i~0#1; {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:36:41,589 INFO L290 TraceCheckUtils]: 107: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:36:41,589 INFO L290 TraceCheckUtils]: 108: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:36:41,589 INFO L290 TraceCheckUtils]: 109: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_~i~0#1 := 2 + main_~i~0#1; {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:36:41,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:36:41,590 INFO L290 TraceCheckUtils]: 111: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:36:41,590 INFO L290 TraceCheckUtils]: 112: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_~i~0#1 := 2 + main_~i~0#1; {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:36:41,590 INFO L290 TraceCheckUtils]: 113: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:36:41,591 INFO L290 TraceCheckUtils]: 114: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:36:41,591 INFO L290 TraceCheckUtils]: 115: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_~i~0#1 := 2 + main_~i~0#1; {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:36:41,593 INFO L290 TraceCheckUtils]: 116: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:36:41,595 INFO L290 TraceCheckUtils]: 117: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:36:41,595 INFO L290 TraceCheckUtils]: 118: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_~i~0#1 := 2 + main_~i~0#1; {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:36:41,595 INFO L290 TraceCheckUtils]: 119: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:36:41,596 INFO L290 TraceCheckUtils]: 120: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:36:41,596 INFO L290 TraceCheckUtils]: 121: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_~i~0#1 := 2 + main_~i~0#1; {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:36:41,596 INFO L290 TraceCheckUtils]: 122: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:36:41,596 INFO L290 TraceCheckUtils]: 123: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:36:41,597 INFO L290 TraceCheckUtils]: 124: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_~i~0#1 := 2 + main_~i~0#1; {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:36:41,597 INFO L290 TraceCheckUtils]: 125: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:36:41,597 INFO L290 TraceCheckUtils]: 126: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:36:41,598 INFO L290 TraceCheckUtils]: 127: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_~i~0#1 := 2 + main_~i~0#1; {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:36:41,598 INFO L290 TraceCheckUtils]: 128: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:36:41,598 INFO L290 TraceCheckUtils]: 129: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:36:41,599 INFO L290 TraceCheckUtils]: 130: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_~i~0#1 := 2 + main_~i~0#1; {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:36:41,599 INFO L290 TraceCheckUtils]: 131: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:36:41,599 INFO L290 TraceCheckUtils]: 132: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:36:41,599 INFO L290 TraceCheckUtils]: 133: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_~i~0#1 := 2 + main_~i~0#1; {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:36:41,600 INFO L290 TraceCheckUtils]: 134: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:36:41,600 INFO L290 TraceCheckUtils]: 135: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:36:41,600 INFO L290 TraceCheckUtils]: 136: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_~i~0#1 := 2 + main_~i~0#1; {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:36:41,601 INFO L290 TraceCheckUtils]: 137: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:36:41,601 INFO L290 TraceCheckUtils]: 138: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:36:41,601 INFO L290 TraceCheckUtils]: 139: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_~i~0#1 := 2 + main_~i~0#1; {3482#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:36:41,601 INFO L290 TraceCheckUtils]: 140: Hoare triple {3482#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !(main_~i~0#1 < 100000); {3435#false} is VALID [2022-02-21 03:36:41,602 INFO L290 TraceCheckUtils]: 141: Hoare triple {3435#false} main_~i~0#1 := 0; {3435#false} is VALID [2022-02-21 03:36:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:41,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:41,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825878959] [2022-02-21 03:36:41,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825878959] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:41,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370009925] [2022-02-21 03:36:41,603 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:41,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:41,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:41,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:37:23,020 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-21 03:37:23,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:23,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:37:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:23,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {3434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {3434#true} is VALID [2022-02-21 03:37:23,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:23,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:23,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:23,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {3489#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:23,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:23,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:23,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:23,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:23,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:23,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:23,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:23,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:23,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:23,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:23,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:23,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:23,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:23,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:23,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:23,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:23,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:23,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:23,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:23,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:23,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:23,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:23,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:23,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:23,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:23,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:23,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:23,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:23,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:23,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:23,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:23,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:23,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:23,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:23,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:23,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:23,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:23,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:23,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:23,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:23,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:23,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:23,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:23,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:23,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {3451#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:23,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:23,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:23,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {3452#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:23,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:23,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:23,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {3453#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:23,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:23,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:23,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {3454#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:23,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:23,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:23,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {3455#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:23,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:23,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:23,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {3456#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:23,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:23,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:23,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {3457#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:23,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:23,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:23,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {3458#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_~i~0#1 := 2 + main_~i~0#1; {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:23,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:23,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:23,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {3459#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_~i~0#1 := 2 + main_~i~0#1; {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:23,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:23,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:23,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {3460#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_~i~0#1 := 2 + main_~i~0#1; {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:23,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:23,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:23,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {3461#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_~i~0#1 := 2 + main_~i~0#1; {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:23,881 INFO L290 TraceCheckUtils]: 80: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:23,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:23,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {3462#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_~i~0#1 := 2 + main_~i~0#1; {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:23,882 INFO L290 TraceCheckUtils]: 83: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:23,882 INFO L290 TraceCheckUtils]: 84: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:23,882 INFO L290 TraceCheckUtils]: 85: Hoare triple {3463#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_~i~0#1 := 2 + main_~i~0#1; {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:23,883 INFO L290 TraceCheckUtils]: 86: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:23,883 INFO L290 TraceCheckUtils]: 87: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:23,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {3464#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_~i~0#1 := 2 + main_~i~0#1; {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:23,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:23,884 INFO L290 TraceCheckUtils]: 90: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:23,884 INFO L290 TraceCheckUtils]: 91: Hoare triple {3465#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_~i~0#1 := 2 + main_~i~0#1; {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:23,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:23,886 INFO L290 TraceCheckUtils]: 93: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:23,886 INFO L290 TraceCheckUtils]: 94: Hoare triple {3466#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_~i~0#1 := 2 + main_~i~0#1; {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:23,886 INFO L290 TraceCheckUtils]: 95: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:23,887 INFO L290 TraceCheckUtils]: 96: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:23,887 INFO L290 TraceCheckUtils]: 97: Hoare triple {3467#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_~i~0#1 := 2 + main_~i~0#1; {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:23,887 INFO L290 TraceCheckUtils]: 98: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:23,888 INFO L290 TraceCheckUtils]: 99: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:23,888 INFO L290 TraceCheckUtils]: 100: Hoare triple {3468#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_~i~0#1 := 2 + main_~i~0#1; {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:23,888 INFO L290 TraceCheckUtils]: 101: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:23,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:23,889 INFO L290 TraceCheckUtils]: 103: Hoare triple {3469#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_~i~0#1 := 2 + main_~i~0#1; {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:23,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:23,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:23,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {3470#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_~i~0#1 := 2 + main_~i~0#1; {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:23,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:23,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:23,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {3471#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_~i~0#1 := 2 + main_~i~0#1; {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:23,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:23,891 INFO L290 TraceCheckUtils]: 111: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:23,892 INFO L290 TraceCheckUtils]: 112: Hoare triple {3472#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_~i~0#1 := 2 + main_~i~0#1; {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:23,892 INFO L290 TraceCheckUtils]: 113: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:23,892 INFO L290 TraceCheckUtils]: 114: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:23,893 INFO L290 TraceCheckUtils]: 115: Hoare triple {3473#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_~i~0#1 := 2 + main_~i~0#1; {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:23,893 INFO L290 TraceCheckUtils]: 116: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:23,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:23,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {3474#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_~i~0#1 := 2 + main_~i~0#1; {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:23,894 INFO L290 TraceCheckUtils]: 119: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:23,895 INFO L290 TraceCheckUtils]: 120: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:23,895 INFO L290 TraceCheckUtils]: 121: Hoare triple {3475#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_~i~0#1 := 2 + main_~i~0#1; {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:23,895 INFO L290 TraceCheckUtils]: 122: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:23,896 INFO L290 TraceCheckUtils]: 123: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:23,896 INFO L290 TraceCheckUtils]: 124: Hoare triple {3476#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_~i~0#1 := 2 + main_~i~0#1; {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:23,896 INFO L290 TraceCheckUtils]: 125: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:23,896 INFO L290 TraceCheckUtils]: 126: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:23,897 INFO L290 TraceCheckUtils]: 127: Hoare triple {3477#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_~i~0#1 := 2 + main_~i~0#1; {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:23,897 INFO L290 TraceCheckUtils]: 128: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:23,897 INFO L290 TraceCheckUtils]: 129: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:23,898 INFO L290 TraceCheckUtils]: 130: Hoare triple {3478#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_~i~0#1 := 2 + main_~i~0#1; {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:23,898 INFO L290 TraceCheckUtils]: 131: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:23,898 INFO L290 TraceCheckUtils]: 132: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:23,899 INFO L290 TraceCheckUtils]: 133: Hoare triple {3479#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_~i~0#1 := 2 + main_~i~0#1; {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:23,899 INFO L290 TraceCheckUtils]: 134: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:23,899 INFO L290 TraceCheckUtils]: 135: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:23,900 INFO L290 TraceCheckUtils]: 136: Hoare triple {3480#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_~i~0#1 := 2 + main_~i~0#1; {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:23,900 INFO L290 TraceCheckUtils]: 137: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:23,900 INFO L290 TraceCheckUtils]: 138: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:23,901 INFO L290 TraceCheckUtils]: 139: Hoare triple {3481#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_~i~0#1 := 2 + main_~i~0#1; {3482#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:37:23,901 INFO L290 TraceCheckUtils]: 140: Hoare triple {3482#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !(main_~i~0#1 < 100000); {3435#false} is VALID [2022-02-21 03:37:23,901 INFO L290 TraceCheckUtils]: 141: Hoare triple {3435#false} main_~i~0#1 := 0; {3435#false} is VALID [2022-02-21 03:37:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:23,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:26,423 INFO L290 TraceCheckUtils]: 141: Hoare triple {3435#false} main_~i~0#1 := 0; {3435#false} is VALID [2022-02-21 03:37:26,423 INFO L290 TraceCheckUtils]: 140: Hoare triple {3913#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {3435#false} is VALID [2022-02-21 03:37:26,424 INFO L290 TraceCheckUtils]: 139: Hoare triple {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_~i~0#1 := 2 + main_~i~0#1; {3913#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:37:26,424 INFO L290 TraceCheckUtils]: 138: Hoare triple {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:37:26,424 INFO L290 TraceCheckUtils]: 137: Hoare triple {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:37:26,425 INFO L290 TraceCheckUtils]: 136: Hoare triple {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_~i~0#1 := 2 + main_~i~0#1; {3917#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:37:26,425 INFO L290 TraceCheckUtils]: 135: Hoare triple {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:37:26,425 INFO L290 TraceCheckUtils]: 134: Hoare triple {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:37:26,428 INFO L290 TraceCheckUtils]: 133: Hoare triple {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_~i~0#1 := 2 + main_~i~0#1; {3927#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:37:26,443 INFO L290 TraceCheckUtils]: 132: Hoare triple {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:37:26,444 INFO L290 TraceCheckUtils]: 131: Hoare triple {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:37:26,444 INFO L290 TraceCheckUtils]: 130: Hoare triple {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_~i~0#1 := 2 + main_~i~0#1; {3937#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:37:26,444 INFO L290 TraceCheckUtils]: 129: Hoare triple {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:37:26,445 INFO L290 TraceCheckUtils]: 128: Hoare triple {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:37:26,445 INFO L290 TraceCheckUtils]: 127: Hoare triple {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_~i~0#1 := 2 + main_~i~0#1; {3947#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:37:26,446 INFO L290 TraceCheckUtils]: 126: Hoare triple {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:37:26,446 INFO L290 TraceCheckUtils]: 125: Hoare triple {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:37:26,447 INFO L290 TraceCheckUtils]: 124: Hoare triple {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_~i~0#1 := 2 + main_~i~0#1; {3957#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:37:26,447 INFO L290 TraceCheckUtils]: 123: Hoare triple {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:37:26,447 INFO L290 TraceCheckUtils]: 122: Hoare triple {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:37:26,448 INFO L290 TraceCheckUtils]: 121: Hoare triple {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_~i~0#1 := 2 + main_~i~0#1; {3967#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:37:26,448 INFO L290 TraceCheckUtils]: 120: Hoare triple {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:37:26,448 INFO L290 TraceCheckUtils]: 119: Hoare triple {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:37:26,448 INFO L290 TraceCheckUtils]: 118: Hoare triple {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_~i~0#1 := 2 + main_~i~0#1; {3977#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:37:26,449 INFO L290 TraceCheckUtils]: 117: Hoare triple {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:37:26,449 INFO L290 TraceCheckUtils]: 116: Hoare triple {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:37:26,449 INFO L290 TraceCheckUtils]: 115: Hoare triple {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_~i~0#1 := 2 + main_~i~0#1; {3987#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:37:26,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:37:26,450 INFO L290 TraceCheckUtils]: 113: Hoare triple {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:37:26,450 INFO L290 TraceCheckUtils]: 112: Hoare triple {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_~i~0#1 := 2 + main_~i~0#1; {3997#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:37:26,450 INFO L290 TraceCheckUtils]: 111: Hoare triple {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:37:26,450 INFO L290 TraceCheckUtils]: 110: Hoare triple {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:37:26,451 INFO L290 TraceCheckUtils]: 109: Hoare triple {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_~i~0#1 := 2 + main_~i~0#1; {4007#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:37:26,451 INFO L290 TraceCheckUtils]: 108: Hoare triple {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:37:26,451 INFO L290 TraceCheckUtils]: 107: Hoare triple {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:37:26,463 INFO L290 TraceCheckUtils]: 106: Hoare triple {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} main_~i~0#1 := 2 + main_~i~0#1; {4017#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:37:26,464 INFO L290 TraceCheckUtils]: 105: Hoare triple {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:37:26,464 INFO L290 TraceCheckUtils]: 104: Hoare triple {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:37:26,464 INFO L290 TraceCheckUtils]: 103: Hoare triple {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} main_~i~0#1 := 2 + main_~i~0#1; {4027#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:37:26,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:37:26,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:37:26,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} main_~i~0#1 := 2 + main_~i~0#1; {4037#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:37:26,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:37:26,466 INFO L290 TraceCheckUtils]: 98: Hoare triple {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:37:26,466 INFO L290 TraceCheckUtils]: 97: Hoare triple {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} main_~i~0#1 := 2 + main_~i~0#1; {4047#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:37:26,466 INFO L290 TraceCheckUtils]: 96: Hoare triple {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:37:26,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:37:26,467 INFO L290 TraceCheckUtils]: 94: Hoare triple {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} main_~i~0#1 := 2 + main_~i~0#1; {4057#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:37:26,467 INFO L290 TraceCheckUtils]: 93: Hoare triple {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:37:26,467 INFO L290 TraceCheckUtils]: 92: Hoare triple {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:37:26,468 INFO L290 TraceCheckUtils]: 91: Hoare triple {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} main_~i~0#1 := 2 + main_~i~0#1; {4067#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:37:26,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:37:26,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:37:26,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} main_~i~0#1 := 2 + main_~i~0#1; {4077#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:37:26,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:37:26,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:37:26,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} main_~i~0#1 := 2 + main_~i~0#1; {4087#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:37:26,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:37:26,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:37:26,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} main_~i~0#1 := 2 + main_~i~0#1; {4097#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:37:26,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:37:26,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:37:26,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} main_~i~0#1 := 2 + main_~i~0#1; {4107#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:37:26,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:37:26,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:37:26,472 INFO L290 TraceCheckUtils]: 76: Hoare triple {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} main_~i~0#1 := 2 + main_~i~0#1; {4117#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:37:26,472 INFO L290 TraceCheckUtils]: 75: Hoare triple {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:37:26,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:37:26,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} main_~i~0#1 := 2 + main_~i~0#1; {4127#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:37:26,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-21 03:37:26,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-21 03:37:26,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} main_~i~0#1 := 2 + main_~i~0#1; {4137#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-21 03:37:26,474 INFO L290 TraceCheckUtils]: 69: Hoare triple {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} is VALID [2022-02-21 03:37:26,474 INFO L290 TraceCheckUtils]: 68: Hoare triple {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} is VALID [2022-02-21 03:37:26,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} main_~i~0#1 := 2 + main_~i~0#1; {4147#(< |ULTIMATE.start_main_~i~0#1| 99952)} is VALID [2022-02-21 03:37:26,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} is VALID [2022-02-21 03:37:26,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} is VALID [2022-02-21 03:37:26,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} main_~i~0#1 := 2 + main_~i~0#1; {4157#(< |ULTIMATE.start_main_~i~0#1| 99950)} is VALID [2022-02-21 03:37:26,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} is VALID [2022-02-21 03:37:26,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} is VALID [2022-02-21 03:37:26,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} main_~i~0#1 := 2 + main_~i~0#1; {4167#(< |ULTIMATE.start_main_~i~0#1| 99948)} is VALID [2022-02-21 03:37:26,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} is VALID [2022-02-21 03:37:26,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} is VALID [2022-02-21 03:37:26,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} main_~i~0#1 := 2 + main_~i~0#1; {4177#(< |ULTIMATE.start_main_~i~0#1| 99946)} is VALID [2022-02-21 03:37:26,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} is VALID [2022-02-21 03:37:26,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} is VALID [2022-02-21 03:37:26,477 INFO L290 TraceCheckUtils]: 55: Hoare triple {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} main_~i~0#1 := 2 + main_~i~0#1; {4187#(< |ULTIMATE.start_main_~i~0#1| 99944)} is VALID [2022-02-21 03:37:26,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} is VALID [2022-02-21 03:37:26,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} is VALID [2022-02-21 03:37:26,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} main_~i~0#1 := 2 + main_~i~0#1; {4197#(< |ULTIMATE.start_main_~i~0#1| 99942)} is VALID [2022-02-21 03:37:26,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} is VALID [2022-02-21 03:37:26,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} is VALID [2022-02-21 03:37:26,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} main_~i~0#1 := 2 + main_~i~0#1; {4207#(< |ULTIMATE.start_main_~i~0#1| 99940)} is VALID [2022-02-21 03:37:26,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} is VALID [2022-02-21 03:37:26,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} is VALID [2022-02-21 03:37:26,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} main_~i~0#1 := 2 + main_~i~0#1; {4217#(< |ULTIMATE.start_main_~i~0#1| 99938)} is VALID [2022-02-21 03:37:26,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} is VALID [2022-02-21 03:37:26,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} is VALID [2022-02-21 03:37:26,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} main_~i~0#1 := 2 + main_~i~0#1; {4227#(< |ULTIMATE.start_main_~i~0#1| 99936)} is VALID [2022-02-21 03:37:26,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} is VALID [2022-02-21 03:37:26,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} is VALID [2022-02-21 03:37:26,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} main_~i~0#1 := 2 + main_~i~0#1; {4237#(< |ULTIMATE.start_main_~i~0#1| 99934)} is VALID [2022-02-21 03:37:26,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} is VALID [2022-02-21 03:37:26,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} is VALID [2022-02-21 03:37:26,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} main_~i~0#1 := 2 + main_~i~0#1; {4247#(< |ULTIMATE.start_main_~i~0#1| 99932)} is VALID [2022-02-21 03:37:26,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} is VALID [2022-02-21 03:37:26,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} is VALID [2022-02-21 03:37:26,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} main_~i~0#1 := 2 + main_~i~0#1; {4257#(< |ULTIMATE.start_main_~i~0#1| 99930)} is VALID [2022-02-21 03:37:26,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} is VALID [2022-02-21 03:37:26,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} is VALID [2022-02-21 03:37:26,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} main_~i~0#1 := 2 + main_~i~0#1; {4267#(< |ULTIMATE.start_main_~i~0#1| 99928)} is VALID [2022-02-21 03:37:26,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} is VALID [2022-02-21 03:37:26,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} is VALID [2022-02-21 03:37:26,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} main_~i~0#1 := 2 + main_~i~0#1; {4277#(< |ULTIMATE.start_main_~i~0#1| 99926)} is VALID [2022-02-21 03:37:26,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} is VALID [2022-02-21 03:37:26,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} is VALID [2022-02-21 03:37:26,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} main_~i~0#1 := 2 + main_~i~0#1; {4287#(< |ULTIMATE.start_main_~i~0#1| 99924)} is VALID [2022-02-21 03:37:26,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} is VALID [2022-02-21 03:37:26,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} is VALID [2022-02-21 03:37:26,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} main_~i~0#1 := 2 + main_~i~0#1; {4297#(< |ULTIMATE.start_main_~i~0#1| 99922)} is VALID [2022-02-21 03:37:26,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} is VALID [2022-02-21 03:37:26,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} is VALID [2022-02-21 03:37:26,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} main_~i~0#1 := 2 + main_~i~0#1; {4307#(< |ULTIMATE.start_main_~i~0#1| 99920)} is VALID [2022-02-21 03:37:26,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} is VALID [2022-02-21 03:37:26,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} is VALID [2022-02-21 03:37:26,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} main_~i~0#1 := 2 + main_~i~0#1; {4317#(< |ULTIMATE.start_main_~i~0#1| 99918)} is VALID [2022-02-21 03:37:26,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} is VALID [2022-02-21 03:37:26,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} is VALID [2022-02-21 03:37:26,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} main_~i~0#1 := 2 + main_~i~0#1; {4327#(< |ULTIMATE.start_main_~i~0#1| 99916)} is VALID [2022-02-21 03:37:26,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} is VALID [2022-02-21 03:37:26,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} is VALID [2022-02-21 03:37:26,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} main_~i~0#1 := 2 + main_~i~0#1; {4337#(< |ULTIMATE.start_main_~i~0#1| 99914)} is VALID [2022-02-21 03:37:26,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} is VALID [2022-02-21 03:37:26,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} is VALID [2022-02-21 03:37:26,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} main_~i~0#1 := 2 + main_~i~0#1; {4347#(< |ULTIMATE.start_main_~i~0#1| 99912)} is VALID [2022-02-21 03:37:26,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} is VALID [2022-02-21 03:37:26,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} is VALID [2022-02-21 03:37:26,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} main_~i~0#1 := 2 + main_~i~0#1; {4357#(< |ULTIMATE.start_main_~i~0#1| 99910)} is VALID [2022-02-21 03:37:26,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} is VALID [2022-02-21 03:37:26,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} is VALID [2022-02-21 03:37:26,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {4367#(< |ULTIMATE.start_main_~i~0#1| 99908)} is VALID [2022-02-21 03:37:26,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {3434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {3434#true} is VALID [2022-02-21 03:37:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:26,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370009925] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:26,495 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:26,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-02-21 03:37:26,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931588186] [2022-02-21 03:37:26,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:26,496 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-02-21 03:37:26,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885418117] [2022-02-21 03:37:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:26,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-21 03:37:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-21 03:37:26,566 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:30,324 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2022-02-21 03:37:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:37:30,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:30,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2022-02-21 03:37:30,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:37:30,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2022-02-21 03:37:30,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2022-02-21 03:37:30,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2022-02-21 03:37:30,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2022-02-21 03:37:30,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:30,598 INFO L681 BuchiCegarLoop]: Abstraction has 757 states and 946 transitions. [2022-02-21 03:37:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2022-02-21 03:37:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2022-02-21 03:37:30,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:30,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 757 states and 946 transitions. Second operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,608 INFO L74 IsIncluded]: Start isIncluded. First operand 757 states and 946 transitions. Second operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,608 INFO L87 Difference]: Start difference. First operand 757 states and 946 transitions. Second operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:30,623 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2022-02-21 03:37:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 946 transitions. [2022-02-21 03:37:30,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 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 757 states and 946 transitions. [2022-02-21 03:37:30,625 INFO L87 Difference]: Start difference. First operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 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 757 states and 946 transitions. [2022-02-21 03:37:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:30,642 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2022-02-21 03:37:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 946 transitions. [2022-02-21 03:37:30,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:30,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2022-02-21 03:37:30,647 INFO L704 BuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-02-21 03:37:30,647 INFO L587 BuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-02-21 03:37:30,647 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:37:30,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2022-02-21 03:37:30,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:37:30,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2022-02-21 03:37:30,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:30,651 INFO L791 eck$LassoCheckResult]: Stem: 5138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 5139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 5142#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5143#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5149#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5144#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5145#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5146#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5147#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5426#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5425#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5424#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5423#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5422#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5421#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5420#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5419#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5418#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5417#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5416#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5415#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5414#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5413#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5412#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5411#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5410#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5409#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5408#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5407#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5406#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5405#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5404#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5403#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5402#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5401#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5400#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5399#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5398#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5397#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5396#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5395#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5394#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5393#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5392#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5391#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5390#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5389#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5388#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5387#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5386#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5385#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5384#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5383#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5382#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5381#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5380#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5379#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5378#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5377#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5376#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5375#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5374#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5373#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5372#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5371#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5370#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5369#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5368#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5367#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5366#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5365#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5364#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5363#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5362#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5361#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5360#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5359#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5358#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5357#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5356#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5355#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5354#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5353#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5352#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5351#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5350#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5349#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5348#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5347#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5346#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5345#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5344#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5343#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5342#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5341#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5340#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5339#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5338#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5337#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5336#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5335#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5334#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5333#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5332#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5331#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5330#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5329#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5328#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5327#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5326#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5325#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5324#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5323#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5322#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5320#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5319#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5318#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5317#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5316#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5315#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5314#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5313#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5312#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5311#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5310#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5309#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5308#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5307#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5306#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5305#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5304#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5303#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5302#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5301#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5300#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5299#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5298#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5297#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5296#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5295#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5294#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5293#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5292#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5291#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5290#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5289#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5288#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5287#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5286#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5284#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5283#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5282#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5281#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5280#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5279#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5277#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5276#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5275#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5274#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5273#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5272#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5271#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5270#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5269#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5268#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5266#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5265#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5264#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5263#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5262#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5261#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5260#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5259#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5258#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5257#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5256#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5255#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5254#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5253#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5252#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5251#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5250#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5249#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5248#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5247#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5246#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5245#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5244#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5243#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5242#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5241#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5240#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5239#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5238#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5237#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5236#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5235#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5234#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5233#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5232#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5231#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5230#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5229#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5228#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5227#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5226#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5225#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5224#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5223#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5222#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5221#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5220#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5219#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5218#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5217#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5216#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5215#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5214#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5213#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5212#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5211#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5210#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5209#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5208#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5207#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5206#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5205#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5204#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5203#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5202#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5201#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5200#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5199#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5198#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5197#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5196#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5195#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5194#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5193#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5192#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5191#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5190#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5189#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5188#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5187#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5185#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5184#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5183#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5182#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5181#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5180#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5179#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5178#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5177#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5176#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5175#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5174#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5173#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5172#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5171#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5170#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5169#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5168#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5167#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5166#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5165#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5164#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5163#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5162#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5161#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5160#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5159#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5158#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5157#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5156#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5155#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5154#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5152#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5153#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5151#L20-3 assume !(main_~i~0#1 < 100000); 5150#L20-4 main_~i~0#1 := 0; 5141#L26-3 [2022-02-21 03:37:30,651 INFO L793 eck$LassoCheckResult]: Loop: 5141#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5148#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5140#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5141#L26-3 [2022-02-21 03:37:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2022-02-21 03:37:30,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:30,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667022843] [2022-02-21 03:37:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:33,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {6944#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {6944#true} is VALID [2022-02-21 03:37:33,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {6944#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:33,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:33,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:33,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {6946#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~i~0#1 := 2 + main_~i~0#1; {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:33,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:33,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:33,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {6947#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~i~0#1 := 2 + main_~i~0#1; {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:33,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:33,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:33,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {6948#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_~i~0#1 := 2 + main_~i~0#1; {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:33,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:33,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:33,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {6949#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_~i~0#1 := 2 + main_~i~0#1; {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:33,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:33,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:33,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {6950#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_~i~0#1 := 2 + main_~i~0#1; {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:33,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:33,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:33,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {6951#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_~i~0#1 := 2 + main_~i~0#1; {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:33,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:33,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:33,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {6952#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_~i~0#1 := 2 + main_~i~0#1; {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:33,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:33,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:33,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {6953#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_~i~0#1 := 2 + main_~i~0#1; {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:33,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:33,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:33,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {6954#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_~i~0#1 := 2 + main_~i~0#1; {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:33,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:33,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:37:33,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {6955#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_~i~0#1 := 2 + main_~i~0#1; {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:33,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:33,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:37:33,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {6956#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_~i~0#1 := 2 + main_~i~0#1; {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:33,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:33,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:37:33,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {6957#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_~i~0#1 := 2 + main_~i~0#1; {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:33,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:33,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:37:33,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {6958#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_~i~0#1 := 2 + main_~i~0#1; {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:33,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:33,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:37:33,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {6959#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_~i~0#1 := 2 + main_~i~0#1; {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:33,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:33,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:37:33,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {6960#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_~i~0#1 := 2 + main_~i~0#1; {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:33,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:33,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:37:33,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {6961#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_~i~0#1 := 2 + main_~i~0#1; {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:33,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:33,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:37:33,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {6962#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_~i~0#1 := 2 + main_~i~0#1; {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:33,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:33,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:37:33,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {6963#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_~i~0#1 := 2 + main_~i~0#1; {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:33,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:33,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:37:33,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {6964#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_~i~0#1 := 2 + main_~i~0#1; {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:33,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:33,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:37:33,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {6965#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_~i~0#1 := 2 + main_~i~0#1; {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:33,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:33,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:37:33,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {6966#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_~i~0#1 := 2 + main_~i~0#1; {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:33,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:33,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:37:33,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {6967#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_~i~0#1 := 2 + main_~i~0#1; {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:33,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:33,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:37:33,564 INFO L290 TraceCheckUtils]: 70: Hoare triple {6968#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_~i~0#1 := 2 + main_~i~0#1; {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:33,564 INFO L290 TraceCheckUtils]: 71: Hoare triple {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:33,564 INFO L290 TraceCheckUtils]: 72: Hoare triple {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:37:33,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {6969#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_~i~0#1 := 2 + main_~i~0#1; {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:33,565 INFO L290 TraceCheckUtils]: 74: Hoare triple {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:33,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:37:33,565 INFO L290 TraceCheckUtils]: 76: Hoare triple {6970#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_~i~0#1 := 2 + main_~i~0#1; {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:33,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:33,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:37:33,567 INFO L290 TraceCheckUtils]: 79: Hoare triple {6971#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_~i~0#1 := 2 + main_~i~0#1; {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:33,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:33,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:37:33,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {6972#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_~i~0#1 := 2 + main_~i~0#1; {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:33,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:33,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:37:33,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {6973#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_~i~0#1 := 2 + main_~i~0#1; {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:33,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:33,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:37:33,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {6974#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_~i~0#1 := 2 + main_~i~0#1; {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:33,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:33,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:37:33,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {6975#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_~i~0#1 := 2 + main_~i~0#1; {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:33,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:33,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:37:33,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {6976#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_~i~0#1 := 2 + main_~i~0#1; {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:33,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:33,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:37:33,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {6977#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_~i~0#1 := 2 + main_~i~0#1; {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:33,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:33,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:37:33,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {6978#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_~i~0#1 := 2 + main_~i~0#1; {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:33,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:33,576 INFO L290 TraceCheckUtils]: 102: Hoare triple {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:37:33,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {6979#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_~i~0#1 := 2 + main_~i~0#1; {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:33,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:33,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:37:33,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {6980#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_~i~0#1 := 2 + main_~i~0#1; {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:33,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:33,578 INFO L290 TraceCheckUtils]: 108: Hoare triple {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:37:33,578 INFO L290 TraceCheckUtils]: 109: Hoare triple {6981#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_~i~0#1 := 2 + main_~i~0#1; {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:33,578 INFO L290 TraceCheckUtils]: 110: Hoare triple {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:33,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:37:33,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {6982#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_~i~0#1 := 2 + main_~i~0#1; {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:33,579 INFO L290 TraceCheckUtils]: 113: Hoare triple {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:33,579 INFO L290 TraceCheckUtils]: 114: Hoare triple {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:37:33,580 INFO L290 TraceCheckUtils]: 115: Hoare triple {6983#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_~i~0#1 := 2 + main_~i~0#1; {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:33,580 INFO L290 TraceCheckUtils]: 116: Hoare triple {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:33,580 INFO L290 TraceCheckUtils]: 117: Hoare triple {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:37:33,580 INFO L290 TraceCheckUtils]: 118: Hoare triple {6984#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_~i~0#1 := 2 + main_~i~0#1; {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:33,581 INFO L290 TraceCheckUtils]: 119: Hoare triple {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:33,581 INFO L290 TraceCheckUtils]: 120: Hoare triple {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:37:33,581 INFO L290 TraceCheckUtils]: 121: Hoare triple {6985#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_~i~0#1 := 2 + main_~i~0#1; {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:33,582 INFO L290 TraceCheckUtils]: 122: Hoare triple {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:33,582 INFO L290 TraceCheckUtils]: 123: Hoare triple {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:37:33,582 INFO L290 TraceCheckUtils]: 124: Hoare triple {6986#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_~i~0#1 := 2 + main_~i~0#1; {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:33,582 INFO L290 TraceCheckUtils]: 125: Hoare triple {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:33,583 INFO L290 TraceCheckUtils]: 126: Hoare triple {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:37:33,583 INFO L290 TraceCheckUtils]: 127: Hoare triple {6987#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_~i~0#1 := 2 + main_~i~0#1; {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:33,583 INFO L290 TraceCheckUtils]: 128: Hoare triple {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:33,583 INFO L290 TraceCheckUtils]: 129: Hoare triple {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:37:33,584 INFO L290 TraceCheckUtils]: 130: Hoare triple {6988#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_~i~0#1 := 2 + main_~i~0#1; {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:33,584 INFO L290 TraceCheckUtils]: 131: Hoare triple {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:33,584 INFO L290 TraceCheckUtils]: 132: Hoare triple {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:37:33,585 INFO L290 TraceCheckUtils]: 133: Hoare triple {6989#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_~i~0#1 := 2 + main_~i~0#1; {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:33,585 INFO L290 TraceCheckUtils]: 134: Hoare triple {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:33,585 INFO L290 TraceCheckUtils]: 135: Hoare triple {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:37:33,585 INFO L290 TraceCheckUtils]: 136: Hoare triple {6990#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_~i~0#1 := 2 + main_~i~0#1; {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:33,586 INFO L290 TraceCheckUtils]: 137: Hoare triple {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:33,586 INFO L290 TraceCheckUtils]: 138: Hoare triple {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:37:33,586 INFO L290 TraceCheckUtils]: 139: Hoare triple {6991#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_~i~0#1 := 2 + main_~i~0#1; {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:37:33,587 INFO L290 TraceCheckUtils]: 140: Hoare triple {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:37:33,587 INFO L290 TraceCheckUtils]: 141: Hoare triple {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:37:33,587 INFO L290 TraceCheckUtils]: 142: Hoare triple {6992#(<= |ULTIMATE.start_main_~i~0#1| 92)} main_~i~0#1 := 2 + main_~i~0#1; {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:37:33,587 INFO L290 TraceCheckUtils]: 143: Hoare triple {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:37:33,588 INFO L290 TraceCheckUtils]: 144: Hoare triple {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:37:33,588 INFO L290 TraceCheckUtils]: 145: Hoare triple {6993#(<= |ULTIMATE.start_main_~i~0#1| 94)} main_~i~0#1 := 2 + main_~i~0#1; {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} is VALID [2022-02-21 03:37:33,588 INFO L290 TraceCheckUtils]: 146: Hoare triple {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} is VALID [2022-02-21 03:37:33,588 INFO L290 TraceCheckUtils]: 147: Hoare triple {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} is VALID [2022-02-21 03:37:33,589 INFO L290 TraceCheckUtils]: 148: Hoare triple {6994#(<= |ULTIMATE.start_main_~i~0#1| 96)} main_~i~0#1 := 2 + main_~i~0#1; {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} is VALID [2022-02-21 03:37:33,589 INFO L290 TraceCheckUtils]: 149: Hoare triple {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} is VALID [2022-02-21 03:37:33,589 INFO L290 TraceCheckUtils]: 150: Hoare triple {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} is VALID [2022-02-21 03:37:33,590 INFO L290 TraceCheckUtils]: 151: Hoare triple {6995#(<= |ULTIMATE.start_main_~i~0#1| 98)} main_~i~0#1 := 2 + main_~i~0#1; {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-21 03:37:33,590 INFO L290 TraceCheckUtils]: 152: Hoare triple {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-21 03:37:33,590 INFO L290 TraceCheckUtils]: 153: Hoare triple {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-21 03:37:33,603 INFO L290 TraceCheckUtils]: 154: Hoare triple {6996#(<= |ULTIMATE.start_main_~i~0#1| 100)} main_~i~0#1 := 2 + main_~i~0#1; {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} is VALID [2022-02-21 03:37:33,604 INFO L290 TraceCheckUtils]: 155: Hoare triple {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} is VALID [2022-02-21 03:37:33,604 INFO L290 TraceCheckUtils]: 156: Hoare triple {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} is VALID [2022-02-21 03:37:33,604 INFO L290 TraceCheckUtils]: 157: Hoare triple {6997#(<= |ULTIMATE.start_main_~i~0#1| 102)} main_~i~0#1 := 2 + main_~i~0#1; {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} is VALID [2022-02-21 03:37:33,605 INFO L290 TraceCheckUtils]: 158: Hoare triple {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} is VALID [2022-02-21 03:37:33,605 INFO L290 TraceCheckUtils]: 159: Hoare triple {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} is VALID [2022-02-21 03:37:33,605 INFO L290 TraceCheckUtils]: 160: Hoare triple {6998#(<= |ULTIMATE.start_main_~i~0#1| 104)} main_~i~0#1 := 2 + main_~i~0#1; {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} is VALID [2022-02-21 03:37:33,607 INFO L290 TraceCheckUtils]: 161: Hoare triple {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} is VALID [2022-02-21 03:37:33,607 INFO L290 TraceCheckUtils]: 162: Hoare triple {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} is VALID [2022-02-21 03:37:33,608 INFO L290 TraceCheckUtils]: 163: Hoare triple {6999#(<= |ULTIMATE.start_main_~i~0#1| 106)} main_~i~0#1 := 2 + main_~i~0#1; {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} is VALID [2022-02-21 03:37:33,608 INFO L290 TraceCheckUtils]: 164: Hoare triple {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} is VALID [2022-02-21 03:37:33,608 INFO L290 TraceCheckUtils]: 165: Hoare triple {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} is VALID [2022-02-21 03:37:33,608 INFO L290 TraceCheckUtils]: 166: Hoare triple {7000#(<= |ULTIMATE.start_main_~i~0#1| 108)} main_~i~0#1 := 2 + main_~i~0#1; {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} is VALID [2022-02-21 03:37:33,609 INFO L290 TraceCheckUtils]: 167: Hoare triple {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} is VALID [2022-02-21 03:37:33,609 INFO L290 TraceCheckUtils]: 168: Hoare triple {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} is VALID [2022-02-21 03:37:33,609 INFO L290 TraceCheckUtils]: 169: Hoare triple {7001#(<= |ULTIMATE.start_main_~i~0#1| 110)} main_~i~0#1 := 2 + main_~i~0#1; {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} is VALID [2022-02-21 03:37:33,609 INFO L290 TraceCheckUtils]: 170: Hoare triple {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} is VALID [2022-02-21 03:37:33,610 INFO L290 TraceCheckUtils]: 171: Hoare triple {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} is VALID [2022-02-21 03:37:33,610 INFO L290 TraceCheckUtils]: 172: Hoare triple {7002#(<= |ULTIMATE.start_main_~i~0#1| 112)} main_~i~0#1 := 2 + main_~i~0#1; {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} is VALID [2022-02-21 03:37:33,610 INFO L290 TraceCheckUtils]: 173: Hoare triple {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} is VALID [2022-02-21 03:37:33,611 INFO L290 TraceCheckUtils]: 174: Hoare triple {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} is VALID [2022-02-21 03:37:33,611 INFO L290 TraceCheckUtils]: 175: Hoare triple {7003#(<= |ULTIMATE.start_main_~i~0#1| 114)} main_~i~0#1 := 2 + main_~i~0#1; {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} is VALID [2022-02-21 03:37:33,611 INFO L290 TraceCheckUtils]: 176: Hoare triple {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} is VALID [2022-02-21 03:37:33,611 INFO L290 TraceCheckUtils]: 177: Hoare triple {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} is VALID [2022-02-21 03:37:33,612 INFO L290 TraceCheckUtils]: 178: Hoare triple {7004#(<= |ULTIMATE.start_main_~i~0#1| 116)} main_~i~0#1 := 2 + main_~i~0#1; {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} is VALID [2022-02-21 03:37:33,612 INFO L290 TraceCheckUtils]: 179: Hoare triple {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} is VALID [2022-02-21 03:37:33,612 INFO L290 TraceCheckUtils]: 180: Hoare triple {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} is VALID [2022-02-21 03:37:33,612 INFO L290 TraceCheckUtils]: 181: Hoare triple {7005#(<= |ULTIMATE.start_main_~i~0#1| 118)} main_~i~0#1 := 2 + main_~i~0#1; {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} is VALID [2022-02-21 03:37:33,613 INFO L290 TraceCheckUtils]: 182: Hoare triple {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} is VALID [2022-02-21 03:37:33,613 INFO L290 TraceCheckUtils]: 183: Hoare triple {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} is VALID [2022-02-21 03:37:33,613 INFO L290 TraceCheckUtils]: 184: Hoare triple {7006#(<= |ULTIMATE.start_main_~i~0#1| 120)} main_~i~0#1 := 2 + main_~i~0#1; {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} is VALID [2022-02-21 03:37:33,614 INFO L290 TraceCheckUtils]: 185: Hoare triple {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} is VALID [2022-02-21 03:37:33,614 INFO L290 TraceCheckUtils]: 186: Hoare triple {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} is VALID [2022-02-21 03:37:33,614 INFO L290 TraceCheckUtils]: 187: Hoare triple {7007#(<= |ULTIMATE.start_main_~i~0#1| 122)} main_~i~0#1 := 2 + main_~i~0#1; {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} is VALID [2022-02-21 03:37:33,614 INFO L290 TraceCheckUtils]: 188: Hoare triple {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} is VALID [2022-02-21 03:37:33,615 INFO L290 TraceCheckUtils]: 189: Hoare triple {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} is VALID [2022-02-21 03:37:33,615 INFO L290 TraceCheckUtils]: 190: Hoare triple {7008#(<= |ULTIMATE.start_main_~i~0#1| 124)} main_~i~0#1 := 2 + main_~i~0#1; {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} is VALID [2022-02-21 03:37:33,615 INFO L290 TraceCheckUtils]: 191: Hoare triple {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} is VALID [2022-02-21 03:37:33,615 INFO L290 TraceCheckUtils]: 192: Hoare triple {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} is VALID [2022-02-21 03:37:33,616 INFO L290 TraceCheckUtils]: 193: Hoare triple {7009#(<= |ULTIMATE.start_main_~i~0#1| 126)} main_~i~0#1 := 2 + main_~i~0#1; {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} is VALID [2022-02-21 03:37:33,616 INFO L290 TraceCheckUtils]: 194: Hoare triple {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} is VALID [2022-02-21 03:37:33,616 INFO L290 TraceCheckUtils]: 195: Hoare triple {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} is VALID [2022-02-21 03:37:33,617 INFO L290 TraceCheckUtils]: 196: Hoare triple {7010#(<= |ULTIMATE.start_main_~i~0#1| 128)} main_~i~0#1 := 2 + main_~i~0#1; {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} is VALID [2022-02-21 03:37:33,617 INFO L290 TraceCheckUtils]: 197: Hoare triple {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} is VALID [2022-02-21 03:37:33,618 INFO L290 TraceCheckUtils]: 198: Hoare triple {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} is VALID [2022-02-21 03:37:33,618 INFO L290 TraceCheckUtils]: 199: Hoare triple {7011#(<= |ULTIMATE.start_main_~i~0#1| 130)} main_~i~0#1 := 2 + main_~i~0#1; {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} is VALID [2022-02-21 03:37:33,620 INFO L290 TraceCheckUtils]: 200: Hoare triple {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} is VALID [2022-02-21 03:37:33,620 INFO L290 TraceCheckUtils]: 201: Hoare triple {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} is VALID [2022-02-21 03:37:33,621 INFO L290 TraceCheckUtils]: 202: Hoare triple {7012#(<= |ULTIMATE.start_main_~i~0#1| 132)} main_~i~0#1 := 2 + main_~i~0#1; {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} is VALID [2022-02-21 03:37:33,624 INFO L290 TraceCheckUtils]: 203: Hoare triple {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} is VALID [2022-02-21 03:37:33,624 INFO L290 TraceCheckUtils]: 204: Hoare triple {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} is VALID [2022-02-21 03:37:33,625 INFO L290 TraceCheckUtils]: 205: Hoare triple {7013#(<= |ULTIMATE.start_main_~i~0#1| 134)} main_~i~0#1 := 2 + main_~i~0#1; {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} is VALID [2022-02-21 03:37:33,626 INFO L290 TraceCheckUtils]: 206: Hoare triple {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} is VALID [2022-02-21 03:37:33,632 INFO L290 TraceCheckUtils]: 207: Hoare triple {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} is VALID [2022-02-21 03:37:33,633 INFO L290 TraceCheckUtils]: 208: Hoare triple {7014#(<= |ULTIMATE.start_main_~i~0#1| 136)} main_~i~0#1 := 2 + main_~i~0#1; {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} is VALID [2022-02-21 03:37:33,633 INFO L290 TraceCheckUtils]: 209: Hoare triple {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} is VALID [2022-02-21 03:37:33,634 INFO L290 TraceCheckUtils]: 210: Hoare triple {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} is VALID [2022-02-21 03:37:33,649 INFO L290 TraceCheckUtils]: 211: Hoare triple {7015#(<= |ULTIMATE.start_main_~i~0#1| 138)} main_~i~0#1 := 2 + main_~i~0#1; {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} is VALID [2022-02-21 03:37:33,649 INFO L290 TraceCheckUtils]: 212: Hoare triple {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} is VALID [2022-02-21 03:37:33,650 INFO L290 TraceCheckUtils]: 213: Hoare triple {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} is VALID [2022-02-21 03:37:33,650 INFO L290 TraceCheckUtils]: 214: Hoare triple {7016#(<= |ULTIMATE.start_main_~i~0#1| 140)} main_~i~0#1 := 2 + main_~i~0#1; {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} is VALID [2022-02-21 03:37:33,650 INFO L290 TraceCheckUtils]: 215: Hoare triple {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} is VALID [2022-02-21 03:37:33,650 INFO L290 TraceCheckUtils]: 216: Hoare triple {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} is VALID [2022-02-21 03:37:33,651 INFO L290 TraceCheckUtils]: 217: Hoare triple {7017#(<= |ULTIMATE.start_main_~i~0#1| 142)} main_~i~0#1 := 2 + main_~i~0#1; {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} is VALID [2022-02-21 03:37:33,651 INFO L290 TraceCheckUtils]: 218: Hoare triple {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} is VALID [2022-02-21 03:37:33,651 INFO L290 TraceCheckUtils]: 219: Hoare triple {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} is VALID [2022-02-21 03:37:33,652 INFO L290 TraceCheckUtils]: 220: Hoare triple {7018#(<= |ULTIMATE.start_main_~i~0#1| 144)} main_~i~0#1 := 2 + main_~i~0#1; {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} is VALID [2022-02-21 03:37:33,652 INFO L290 TraceCheckUtils]: 221: Hoare triple {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} is VALID [2022-02-21 03:37:33,652 INFO L290 TraceCheckUtils]: 222: Hoare triple {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} is VALID [2022-02-21 03:37:33,652 INFO L290 TraceCheckUtils]: 223: Hoare triple {7019#(<= |ULTIMATE.start_main_~i~0#1| 146)} main_~i~0#1 := 2 + main_~i~0#1; {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} is VALID [2022-02-21 03:37:33,653 INFO L290 TraceCheckUtils]: 224: Hoare triple {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} is VALID [2022-02-21 03:37:33,653 INFO L290 TraceCheckUtils]: 225: Hoare triple {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} is VALID [2022-02-21 03:37:33,653 INFO L290 TraceCheckUtils]: 226: Hoare triple {7020#(<= |ULTIMATE.start_main_~i~0#1| 148)} main_~i~0#1 := 2 + main_~i~0#1; {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} is VALID [2022-02-21 03:37:33,653 INFO L290 TraceCheckUtils]: 227: Hoare triple {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} is VALID [2022-02-21 03:37:33,654 INFO L290 TraceCheckUtils]: 228: Hoare triple {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} is VALID [2022-02-21 03:37:33,654 INFO L290 TraceCheckUtils]: 229: Hoare triple {7021#(<= |ULTIMATE.start_main_~i~0#1| 150)} main_~i~0#1 := 2 + main_~i~0#1; {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} is VALID [2022-02-21 03:37:33,656 INFO L290 TraceCheckUtils]: 230: Hoare triple {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} is VALID [2022-02-21 03:37:33,656 INFO L290 TraceCheckUtils]: 231: Hoare triple {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} is VALID [2022-02-21 03:37:33,656 INFO L290 TraceCheckUtils]: 232: Hoare triple {7022#(<= |ULTIMATE.start_main_~i~0#1| 152)} main_~i~0#1 := 2 + main_~i~0#1; {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} is VALID [2022-02-21 03:37:33,657 INFO L290 TraceCheckUtils]: 233: Hoare triple {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} is VALID [2022-02-21 03:37:33,657 INFO L290 TraceCheckUtils]: 234: Hoare triple {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} is VALID [2022-02-21 03:37:33,657 INFO L290 TraceCheckUtils]: 235: Hoare triple {7023#(<= |ULTIMATE.start_main_~i~0#1| 154)} main_~i~0#1 := 2 + main_~i~0#1; {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} is VALID [2022-02-21 03:37:33,658 INFO L290 TraceCheckUtils]: 236: Hoare triple {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} is VALID [2022-02-21 03:37:33,658 INFO L290 TraceCheckUtils]: 237: Hoare triple {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} is VALID [2022-02-21 03:37:33,658 INFO L290 TraceCheckUtils]: 238: Hoare triple {7024#(<= |ULTIMATE.start_main_~i~0#1| 156)} main_~i~0#1 := 2 + main_~i~0#1; {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} is VALID [2022-02-21 03:37:33,658 INFO L290 TraceCheckUtils]: 239: Hoare triple {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} is VALID [2022-02-21 03:37:33,659 INFO L290 TraceCheckUtils]: 240: Hoare triple {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} is VALID [2022-02-21 03:37:33,659 INFO L290 TraceCheckUtils]: 241: Hoare triple {7025#(<= |ULTIMATE.start_main_~i~0#1| 158)} main_~i~0#1 := 2 + main_~i~0#1; {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} is VALID [2022-02-21 03:37:33,659 INFO L290 TraceCheckUtils]: 242: Hoare triple {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} is VALID [2022-02-21 03:37:33,659 INFO L290 TraceCheckUtils]: 243: Hoare triple {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} is VALID [2022-02-21 03:37:33,660 INFO L290 TraceCheckUtils]: 244: Hoare triple {7026#(<= |ULTIMATE.start_main_~i~0#1| 160)} main_~i~0#1 := 2 + main_~i~0#1; {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} is VALID [2022-02-21 03:37:33,660 INFO L290 TraceCheckUtils]: 245: Hoare triple {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} is VALID [2022-02-21 03:37:33,660 INFO L290 TraceCheckUtils]: 246: Hoare triple {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} is VALID [2022-02-21 03:37:33,660 INFO L290 TraceCheckUtils]: 247: Hoare triple {7027#(<= |ULTIMATE.start_main_~i~0#1| 162)} main_~i~0#1 := 2 + main_~i~0#1; {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} is VALID [2022-02-21 03:37:33,661 INFO L290 TraceCheckUtils]: 248: Hoare triple {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} is VALID [2022-02-21 03:37:33,661 INFO L290 TraceCheckUtils]: 249: Hoare triple {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} is VALID [2022-02-21 03:37:33,661 INFO L290 TraceCheckUtils]: 250: Hoare triple {7028#(<= |ULTIMATE.start_main_~i~0#1| 164)} main_~i~0#1 := 2 + main_~i~0#1; {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} is VALID [2022-02-21 03:37:33,661 INFO L290 TraceCheckUtils]: 251: Hoare triple {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} is VALID [2022-02-21 03:37:33,662 INFO L290 TraceCheckUtils]: 252: Hoare triple {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} is VALID [2022-02-21 03:37:33,662 INFO L290 TraceCheckUtils]: 253: Hoare triple {7029#(<= |ULTIMATE.start_main_~i~0#1| 166)} main_~i~0#1 := 2 + main_~i~0#1; {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} is VALID [2022-02-21 03:37:33,662 INFO L290 TraceCheckUtils]: 254: Hoare triple {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} is VALID [2022-02-21 03:37:33,663 INFO L290 TraceCheckUtils]: 255: Hoare triple {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} is VALID [2022-02-21 03:37:33,663 INFO L290 TraceCheckUtils]: 256: Hoare triple {7030#(<= |ULTIMATE.start_main_~i~0#1| 168)} main_~i~0#1 := 2 + main_~i~0#1; {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} is VALID [2022-02-21 03:37:33,663 INFO L290 TraceCheckUtils]: 257: Hoare triple {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} is VALID [2022-02-21 03:37:33,663 INFO L290 TraceCheckUtils]: 258: Hoare triple {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} is VALID [2022-02-21 03:37:33,664 INFO L290 TraceCheckUtils]: 259: Hoare triple {7031#(<= |ULTIMATE.start_main_~i~0#1| 170)} main_~i~0#1 := 2 + main_~i~0#1; {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} is VALID [2022-02-21 03:37:33,664 INFO L290 TraceCheckUtils]: 260: Hoare triple {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} is VALID [2022-02-21 03:37:33,664 INFO L290 TraceCheckUtils]: 261: Hoare triple {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} is VALID [2022-02-21 03:37:33,665 INFO L290 TraceCheckUtils]: 262: Hoare triple {7032#(<= |ULTIMATE.start_main_~i~0#1| 172)} main_~i~0#1 := 2 + main_~i~0#1; {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} is VALID [2022-02-21 03:37:33,665 INFO L290 TraceCheckUtils]: 263: Hoare triple {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} is VALID [2022-02-21 03:37:33,665 INFO L290 TraceCheckUtils]: 264: Hoare triple {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} is VALID [2022-02-21 03:37:33,665 INFO L290 TraceCheckUtils]: 265: Hoare triple {7033#(<= |ULTIMATE.start_main_~i~0#1| 174)} main_~i~0#1 := 2 + main_~i~0#1; {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} is VALID [2022-02-21 03:37:33,666 INFO L290 TraceCheckUtils]: 266: Hoare triple {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} is VALID [2022-02-21 03:37:33,666 INFO L290 TraceCheckUtils]: 267: Hoare triple {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} is VALID [2022-02-21 03:37:33,666 INFO L290 TraceCheckUtils]: 268: Hoare triple {7034#(<= |ULTIMATE.start_main_~i~0#1| 176)} main_~i~0#1 := 2 + main_~i~0#1; {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} is VALID [2022-02-21 03:37:33,666 INFO L290 TraceCheckUtils]: 269: Hoare triple {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} is VALID [2022-02-21 03:37:33,667 INFO L290 TraceCheckUtils]: 270: Hoare triple {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} is VALID [2022-02-21 03:37:33,667 INFO L290 TraceCheckUtils]: 271: Hoare triple {7035#(<= |ULTIMATE.start_main_~i~0#1| 178)} main_~i~0#1 := 2 + main_~i~0#1; {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} is VALID [2022-02-21 03:37:33,667 INFO L290 TraceCheckUtils]: 272: Hoare triple {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} is VALID [2022-02-21 03:37:33,668 INFO L290 TraceCheckUtils]: 273: Hoare triple {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} is VALID [2022-02-21 03:37:33,668 INFO L290 TraceCheckUtils]: 274: Hoare triple {7036#(<= |ULTIMATE.start_main_~i~0#1| 180)} main_~i~0#1 := 2 + main_~i~0#1; {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} is VALID [2022-02-21 03:37:33,668 INFO L290 TraceCheckUtils]: 275: Hoare triple {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} is VALID [2022-02-21 03:37:33,668 INFO L290 TraceCheckUtils]: 276: Hoare triple {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} is VALID [2022-02-21 03:37:33,669 INFO L290 TraceCheckUtils]: 277: Hoare triple {7037#(<= |ULTIMATE.start_main_~i~0#1| 182)} main_~i~0#1 := 2 + main_~i~0#1; {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} is VALID [2022-02-21 03:37:33,669 INFO L290 TraceCheckUtils]: 278: Hoare triple {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} is VALID [2022-02-21 03:37:33,669 INFO L290 TraceCheckUtils]: 279: Hoare triple {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} is VALID [2022-02-21 03:37:33,670 INFO L290 TraceCheckUtils]: 280: Hoare triple {7038#(<= |ULTIMATE.start_main_~i~0#1| 184)} main_~i~0#1 := 2 + main_~i~0#1; {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} is VALID [2022-02-21 03:37:33,670 INFO L290 TraceCheckUtils]: 281: Hoare triple {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} is VALID [2022-02-21 03:37:33,670 INFO L290 TraceCheckUtils]: 282: Hoare triple {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} is VALID [2022-02-21 03:37:33,671 INFO L290 TraceCheckUtils]: 283: Hoare triple {7039#(<= |ULTIMATE.start_main_~i~0#1| 186)} main_~i~0#1 := 2 + main_~i~0#1; {7040#(<= |ULTIMATE.start_main_~i~0#1| 188)} is VALID [2022-02-21 03:37:33,671 INFO L290 TraceCheckUtils]: 284: Hoare triple {7040#(<= |ULTIMATE.start_main_~i~0#1| 188)} assume !(main_~i~0#1 < 100000); {6945#false} is VALID [2022-02-21 03:37:33,671 INFO L290 TraceCheckUtils]: 285: Hoare triple {6945#false} main_~i~0#1 := 0; {6945#false} is VALID [2022-02-21 03:37:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:33,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:33,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667022843] [2022-02-21 03:37:33,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667022843] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:33,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512992812] [2022-02-21 03:37:33,678 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:37:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:33,680 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:33,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process