./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/LexIndexValue-Array-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:21,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:21,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:21,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:21,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:21,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:21,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:21,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:21,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:21,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:21,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:21,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:21,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:21,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:21,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:21,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:21,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:21,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:21,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:21,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:21,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:21,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:21,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:21,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:21,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:21,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:21,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:21,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:21,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:21,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:21,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:21,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:21,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:21,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:21,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:21,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:21,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:21,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:21,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:21,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:21,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:21,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:21,331 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:21,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:21,332 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:21,332 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:21,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:21,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:21,333 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:21,334 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:21,334 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:21,334 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:21,334 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:21,335 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:21,335 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:21,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:21,335 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:21,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:21,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:21,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:21,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:21,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:21,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:21,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:21,339 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:21,339 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff [2022-02-21 03:23:21,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:21,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:21,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:21,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:21,531 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:21,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2022-02-21 03:23:21,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bf47f0f/a464a6b924cc4ec3888d2251546abec8/FLAGda41b166b [2022-02-21 03:23:21,901 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:21,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2022-02-21 03:23:21,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bf47f0f/a464a6b924cc4ec3888d2251546abec8/FLAGda41b166b [2022-02-21 03:23:22,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bf47f0f/a464a6b924cc4ec3888d2251546abec8 [2022-02-21 03:23:22,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:22,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:22,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:22,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:22,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:22,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50189c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22, skipping insertion in model container [2022-02-21 03:23:22,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:22,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:22,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:22,514 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:22,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:22,545 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:22,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22 WrapperNode [2022-02-21 03:23:22,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:22,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:22,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:22,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:22,552 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:23:22" (1/1) ... [2022-02-21 03:23:22,558 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:23:22" (1/1) ... [2022-02-21 03:23:22,574 INFO L137 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-02-21 03:23:22,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:22,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:22,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:22,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:22,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:22,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:22,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:22,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:22,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (1/1) ... [2022-02-21 03:23:22,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:22,623 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:23:22,642 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:23:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:23:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:22,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:23:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:23:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:23:22,695 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:22,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:22,803 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:22,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:22,807 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:23:22,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:22 BoogieIcfgContainer [2022-02-21 03:23:22,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:22,809 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:22,809 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:22,812 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:22,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:22,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:22" (1/3) ... [2022-02-21 03:23:22,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e344c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:22, skipping insertion in model container [2022-02-21 03:23:22,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:22,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:22" (2/3) ... [2022-02-21 03:23:22,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e344c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:22, skipping insertion in model container [2022-02-21 03:23:22,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:22,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:22" (3/3) ... [2022-02-21 03:23:22,815 INFO L388 chiAutomizerObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2022-02-21 03:23:22,843 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:22,843 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:22,843 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:22,843 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:22,843 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:22,844 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:22,844 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:22,844 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:22,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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:23:22,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:23:22,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:22,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:22,876 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:22,877 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:22,877 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:22,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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:23:22,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:23:22,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:22,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:22,880 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:22,880 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:22,885 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 12#L14-3true [2022-02-21 03:23:22,885 INFO L793 eck$LassoCheckResult]: Loop: 12#L14-3true assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 13#L14-2true main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 12#L14-3true [2022-02-21 03:23:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:23:22,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:22,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175256979] [2022-02-21 03:23:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:22,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:22,997 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:23:22,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:23,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009342476] [2022-02-21 03:23:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:23,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:23,033 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:23:23,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:23,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145866738] [2022-02-21 03:23:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:23,069 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:23,078 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:23,309 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:23,310 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:23,310 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:23,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:23,310 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:23,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,311 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:23,311 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:23,311 INFO L133 ssoRankerPreferences]: Filename of dumped script: LexIndexValue-Array-1.c_Iteration1_Lasso [2022-02-21 03:23:23,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:23,311 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:23,324 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:23:23,329 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:23:23,333 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:23:23,338 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:23:23,341 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:23:23,345 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:23:23,348 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:23:23,425 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:23:23,428 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:23:23,431 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:23:23,434 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:23:23,436 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:23:23,601 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:23,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:23,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,606 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:23:23,608 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:23:23,609 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:23:23,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:23,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:23,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:23,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:23:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,662 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:23:23,662 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:23:23,664 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:23:23,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:23,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:23,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:23,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:23:23,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,687 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:23:23,687 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:23:23,689 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:23:23,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:23,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:23,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:23,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,721 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:23:23,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,723 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:23:23,724 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:23:23,725 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:23:23,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:23,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:23,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:23:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,765 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:23:23,766 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:23:23,768 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:23:23,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:23,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:23,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,806 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:23:23,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,807 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:23:23,809 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:23:23,810 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:23:23,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:23,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:23,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:23,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,844 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:23:23,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,846 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:23:23,847 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:23:23,849 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:23:23,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:23,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:23,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:23,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,892 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:23:23,893 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:23:23,895 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:23:23,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:23,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:23,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,944 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:23:23,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,947 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:23:23,947 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:23:23,948 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:23:23,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:23,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:23,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:23,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:23:23,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:23,983 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:23:23,984 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:23:23,986 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:23:23,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:23,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:23,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:23,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:23,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:23,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:23,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:24,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:24,018 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:23:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:24,019 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:23:24,020 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:23:24,021 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:23:24,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:24,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:24,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:24,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:24,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:24,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:24,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:24,094 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 03:23:24,094 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:23:24,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:24,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:24,132 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:23:24,133 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:23:24,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:24,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:23:24,141 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:24,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:23:24,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:23:24,177 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:23:24,181 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;" "main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1;" [2022-02-21 03:23:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:23:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:24,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2022-02-21 03:23:24,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {22#unseeded} is VALID [2022-02-21 03:23:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:24,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (+ (* 2095 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {48#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~i~0#1| 1048) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 2095))))} is VALID [2022-02-21 03:23:24,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~i~0#1| 1048) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 2095))))} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {40#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2095 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:23:24,337 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:23:24,365 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:23:24,370 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:23:24,371 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,375 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:23:24,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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.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:23:24,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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.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) Result 28 states and 43 transitions. Complement of second has 8 states. [2022-02-21 03:23:24,437 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:23:24,437 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:24,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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:23:24,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:23:24,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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:23:24,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:24,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2022-02-21 03:23:24,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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:23:24,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:23:24,445 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:23:24,445 INFO L70 LassoExtractor]: Start lassoExtractor. 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:23:24,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:24,446 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:23:24,446 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 43 transitions. cyclomatic complexity: 19 [2022-02-21 03:23:24,447 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:23:24,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:23:24,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:24,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,449 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 28 letters. Loop has 28 letters. [2022-02-21 03:23:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:23:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:23:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 12 letters. Loop has 12 letters. [2022-02-21 03:23:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,451 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:23:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:23:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:23:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:23:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,455 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:23:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,457 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:23:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:23:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:23:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:23:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:23:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,464 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 43 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,465 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. 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:23:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 03:23:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:23:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:24,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. cyclomatic complexity: 19 [2022-02-21 03:23:24,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 10 states and 14 transitions. [2022-02-21 03:23:24,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:24,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:23:24,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2022-02-21 03:23:24,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:24,475 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-02-21 03:23:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2022-02-21 03:23:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-21 03:23:24,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:24,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:23:24,491 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:23:24,493 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:23:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,495 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:23:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:23:24,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 10 states and 14 transitions. [2022-02-21 03:23:24,496 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 10 states and 14 transitions. [2022-02-21 03:23:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,497 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:23:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:23:24,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:24,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:23:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2022-02-21 03:23:24,499 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2022-02-21 03:23:24,499 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2022-02-21 03:23:24,499 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:24,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2022-02-21 03:23:24,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,500 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:24,500 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:24,500 INFO L791 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 95#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 97#L14-3 assume !(main_~i~0#1 < 1048); 91#L19-2 [2022-02-21 03:23:24,500 INFO L793 eck$LassoCheckResult]: Loop: 91#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 92#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 93#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 96#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 91#L19-2 [2022-02-21 03:23:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-02-21 03:23:24,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:24,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996738428] [2022-02-21 03:23:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {123#true} is VALID [2022-02-21 03:23:24,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {125#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:24,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 1048); {124#false} is VALID [2022-02-21 03:23:24,529 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:23:24,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:24,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996738428] [2022-02-21 03:23:24,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996738428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:24,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:24,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:23:24,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48104216] [2022-02-21 03:23:24,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:24,532 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 1 times [2022-02-21 03:23:24,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:24,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026507789] [2022-02-21 03:23:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:24,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:24,543 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:24,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:23:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:23:24,662 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have 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:23:24,675 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:23:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,679 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:23:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:23:24,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have 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:23:24,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:24,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2022-02-21 03:23:24,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:23:24,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:24,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:24,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:23:24,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:24,686 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:23:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:23:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-21 03:23:24,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:24,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,687 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,687 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,688 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:23:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:23:24,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 13 transitions. [2022-02-21 03:23:24,689 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 13 transitions. [2022-02-21 03:23:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,689 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:23:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:23:24,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:24,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:23:24,690 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:23:24,690 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:23:24,691 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:24,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:23:24,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:24,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:24,692 INFO L791 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 144#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 145#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 146#L14-3 assume !(main_~i~0#1 < 1048); 138#L19-2 [2022-02-21 03:23:24,692 INFO L793 eck$LassoCheckResult]: Loop: 138#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 139#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 140#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 143#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 138#L19-2 [2022-02-21 03:23:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-02-21 03:23:24,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:24,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060162892] [2022-02-21 03:23:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:24,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2022-02-21 03:23:24,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {172#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:24,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {172#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:24,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {173#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:24,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {173#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {171#false} is VALID [2022-02-21 03:23:24,727 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:23:24,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:24,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060162892] [2022-02-21 03:23:24,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060162892] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:24,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054739848] [2022-02-21 03:23:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:24,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:24,730 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:23:24,731 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:23:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:23:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:24,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:24,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2022-02-21 03:23:24,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {180#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:24,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {180#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:24,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {180#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {173#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:24,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {173#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {171#false} is VALID [2022-02-21 03:23:24,796 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:23:24,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:24,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {190#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {171#false} is VALID [2022-02-21 03:23:24,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {190#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:24,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {194#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:24,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {194#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:24,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2022-02-21 03:23:24,842 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:23:24,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054739848] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:24,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:24,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 03:23:24,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554545449] [2022-02-21 03:23:24,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:24,843 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 2 times [2022-02-21 03:23:24,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:24,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439485921] [2022-02-21 03:23:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:24,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:24,855 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:24,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:23:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:23:24,934 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,980 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:23:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:23:24,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:24,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:24,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 03:23:24,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:24,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:24,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:24,993 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:23:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:23:24,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:24,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 18 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:23:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 18 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:23:24,994 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:23:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,995 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:23:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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 15 states and 18 transitions. [2022-02-21 03:23:24,995 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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 15 states and 18 transitions. [2022-02-21 03:23:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:24,996 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:23:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:24,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:24,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:24,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 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:23:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 03:23:24,997 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:23:24,997 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:23:24,998 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:24,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:23:24,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:24,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:24,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:24,998 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-02-21 03:23:24,998 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:24,999 INFO L791 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 224#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 225#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 226#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 227#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 232#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 231#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 230#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 229#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 228#L14-3 assume !(main_~i~0#1 < 1048); 218#L19-2 [2022-02-21 03:23:24,999 INFO L793 eck$LassoCheckResult]: Loop: 218#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 219#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 220#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 223#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 218#L19-2 [2022-02-21 03:23:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-02-21 03:23:24,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:25,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254846604] [2022-02-21 03:23:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {266#true} is VALID [2022-02-21 03:23:25,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {268#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {268#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {272#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {267#false} is VALID [2022-02-21 03:23:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:25,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:25,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254846604] [2022-02-21 03:23:25,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254846604] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:25,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972698138] [2022-02-21 03:23:25,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:25,072 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:23:25,073 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:23:25,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:25,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:25,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:25,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {266#true} is VALID [2022-02-21 03:23:25,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {279#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {279#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {272#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {267#false} is VALID [2022-02-21 03:23:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:25,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:25,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {267#false} is VALID [2022-02-21 03:23:25,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {307#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:25,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {311#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:25,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {311#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:25,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {318#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:25,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {318#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:25,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {325#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {325#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:25,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {332#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {325#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:25,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {332#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:25,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {332#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:25,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {266#true} is VALID [2022-02-21 03:23:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:25,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972698138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:25,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:25,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-02-21 03:23:25,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750395660] [2022-02-21 03:23:25,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:25,298 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 3 times [2022-02-21 03:23:25,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:25,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442178834] [2022-02-21 03:23:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:25,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:25,315 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:25,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:23:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:23:25,380 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:23:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:25,455 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 03:23:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:23:25,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:23:25,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:25,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:25,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 30 transitions. [2022-02-21 03:23:25,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:25,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:25,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:25,477 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:23:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-21 03:23:25,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:25,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:23:25,479 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:23:25,479 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:23:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:25,480 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 03:23:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:25,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:25,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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 27 states and 30 transitions. [2022-02-21 03:23:25,480 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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 27 states and 30 transitions. [2022-02-21 03:23:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:25,481 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 03:23:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:25,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:25,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:25,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:23:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-21 03:23:25,483 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:23:25,483 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:23:25,483 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:23:25,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:23:25,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:25,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:25,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:25,484 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-02-21 03:23:25,484 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:25,484 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 374#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 375#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 376#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 377#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 378#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 394#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 393#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 392#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 391#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 390#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 389#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 388#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 387#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 386#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 385#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 384#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 383#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 382#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 381#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 380#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 379#L14-3 assume !(main_~i~0#1 < 1048); 368#L19-2 [2022-02-21 03:23:25,484 INFO L793 eck$LassoCheckResult]: Loop: 368#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 369#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 370#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 373#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 368#L19-2 [2022-02-21 03:23:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-02-21 03:23:25,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:25,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953842479] [2022-02-21 03:23:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,606 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; {452#true} is VALID [2022-02-21 03:23:25,607 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~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {454#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {454#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:25,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:25,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:25,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:25,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:25,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:25,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:25,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:25,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:25,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:25,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {464#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:25,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {464#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {453#false} is VALID [2022-02-21 03:23:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:25,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:25,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953842479] [2022-02-21 03:23:25,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953842479] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:25,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652315534] [2022-02-21 03:23:25,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:23:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:25,617 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:23:25,617 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:23:25,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:23:25,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:25,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:25,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:25,850 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; {452#true} is VALID [2022-02-21 03:23:25,850 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~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {471#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:25,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:25,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:25,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:25,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:25,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:25,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:25,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:25,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:25,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {460#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:25,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:25,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:25,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:25,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:25,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:25,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {463#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {464#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:25,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {464#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {453#false} is VALID [2022-02-21 03:23:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:25,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:26,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {453#false} is VALID [2022-02-21 03:23:26,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {535#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:26,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {539#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {539#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:26,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {546#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {539#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:26,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {546#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {546#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:26,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {553#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {546#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:26,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {553#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {553#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:26,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {560#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {553#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:26,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {560#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {560#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:26,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(< |ULTIMATE.start_main_~i~0#1| 1043)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {560#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:26,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#(< |ULTIMATE.start_main_~i~0#1| 1043)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {567#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:26,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(< |ULTIMATE.start_main_~i~0#1| 1042)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {567#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:26,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(< |ULTIMATE.start_main_~i~0#1| 1042)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {574#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:26,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(< |ULTIMATE.start_main_~i~0#1| 1041)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {574#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:26,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#(< |ULTIMATE.start_main_~i~0#1| 1041)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {581#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:26,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {588#(< |ULTIMATE.start_main_~i~0#1| 1040)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {581#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:26,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#(< |ULTIMATE.start_main_~i~0#1| 1040)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {588#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:26,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#(< |ULTIMATE.start_main_~i~0#1| 1039)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {588#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:26,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {595#(< |ULTIMATE.start_main_~i~0#1| 1039)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {595#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:26,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {602#(< |ULTIMATE.start_main_~i~0#1| 1038)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {595#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:26,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#(< |ULTIMATE.start_main_~i~0#1| 1038)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {602#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:26,157 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~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {602#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:26,157 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; {452#true} is VALID [2022-02-21 03:23:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:26,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652315534] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:26,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:26,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-02-21 03:23:26,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127756806] [2022-02-21 03:23:26,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:26,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 4 times [2022-02-21 03:23:26,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:26,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172763904] [2022-02-21 03:23:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:26,172 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:26,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:23:26,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:23:26,230 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:26,364 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-21 03:23:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:23:26,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:26,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:26,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 54 transitions. [2022-02-21 03:23:26,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:26,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:26,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:26,401 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-02-21 03:23:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-21 03:23:26,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:26,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 54 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,403 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 54 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,403 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:26,404 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-21 03:23:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:26,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:26,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states and 54 transitions. [2022-02-21 03:23:26,405 INFO L87 Difference]: Start difference. First operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states and 54 transitions. [2022-02-21 03:23:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:26,406 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-21 03:23:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:26,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:26,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:26,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-02-21 03:23:26,407 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-02-21 03:23:26,407 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-02-21 03:23:26,408 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:23:26,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2022-02-21 03:23:26,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:26,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:26,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:26,409 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1] [2022-02-21 03:23:26,409 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:26,409 INFO L791 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 666#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 668#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 671#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 672#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 669#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 670#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 712#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 711#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 710#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 709#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 708#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 707#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 706#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 705#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 704#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 703#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 702#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 701#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 700#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 699#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 698#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 697#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 696#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 695#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 694#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 693#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 692#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 691#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 690#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 689#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 688#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 687#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 686#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 685#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 684#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 683#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 682#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 681#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 680#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 679#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 678#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 677#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 676#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 675#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 674#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 673#L14-3 assume !(main_~i~0#1 < 1048); 662#L19-2 [2022-02-21 03:23:26,411 INFO L793 eck$LassoCheckResult]: Loop: 662#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 663#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 664#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 667#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 662#L19-2 [2022-02-21 03:23:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash -111832455, now seen corresponding path program 4 times [2022-02-21 03:23:26,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:26,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795708715] [2022-02-21 03:23:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:26,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {818#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {818#true} is VALID [2022-02-21 03:23:26,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {818#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {820#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:26,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {820#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {820#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:26,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {820#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:26,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:26,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:26,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:26,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:26,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:26,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:26,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:26,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:26,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:26,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:26,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:26,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:26,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:26,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:26,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:26,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:26,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:26,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:26,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:26,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:26,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:26,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:26,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:26,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:26,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:26,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:26,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:26,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:26,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:26,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:26,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:26,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:26,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:26,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:26,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:26,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:26,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:26,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:26,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:26,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:26,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:26,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {842#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:26,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1048); {819#false} is VALID [2022-02-21 03:23:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:26,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:26,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795708715] [2022-02-21 03:23:26,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795708715] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:26,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173177951] [2022-02-21 03:23:26,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:23:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:26,741 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:23:26,742 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:23:26,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:23:26,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:26,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:23:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:26,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:27,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {818#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {818#true} is VALID [2022-02-21 03:23:27,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {818#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {849#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:27,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:27,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:27,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:27,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:27,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:27,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:27,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:27,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:27,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:27,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:27,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:27,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:27,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:27,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:27,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:27,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {827#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:27,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:27,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {828#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:27,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:27,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {829#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:27,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:27,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {830#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:27,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:27,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {831#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:27,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:27,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {832#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:27,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:27,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {833#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:27,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:27,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {834#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:27,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:27,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {835#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:27,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:27,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {836#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:27,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:27,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {837#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:27,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:27,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {838#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:27,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:27,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {839#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:27,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:27,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:27,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:27,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {842#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:27,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1048); {819#false} is VALID [2022-02-21 03:23:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:27,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:27,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {985#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {819#false} is VALID [2022-02-21 03:23:27,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {989#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {985#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:27,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {989#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {989#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:27,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {996#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {989#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:27,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {996#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {996#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:27,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {1003#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {996#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:27,997 INFO L290 TraceCheckUtils]: 40: Hoare triple {1003#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1003#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:27,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {1010#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1003#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:27,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {1010#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1010#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:27,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {1017#(< |ULTIMATE.start_main_~i~0#1| 1043)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1010#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:27,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {1017#(< |ULTIMATE.start_main_~i~0#1| 1043)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1017#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:27,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {1024#(< |ULTIMATE.start_main_~i~0#1| 1042)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1017#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:28,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {1024#(< |ULTIMATE.start_main_~i~0#1| 1042)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1024#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:28,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {1031#(< |ULTIMATE.start_main_~i~0#1| 1041)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1024#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:28,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {1031#(< |ULTIMATE.start_main_~i~0#1| 1041)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1031#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:28,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {1038#(< |ULTIMATE.start_main_~i~0#1| 1040)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1031#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:28,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {1038#(< |ULTIMATE.start_main_~i~0#1| 1040)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1038#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:28,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {1045#(< |ULTIMATE.start_main_~i~0#1| 1039)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1038#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:28,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {1045#(< |ULTIMATE.start_main_~i~0#1| 1039)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1045#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:28,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {1052#(< |ULTIMATE.start_main_~i~0#1| 1038)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1045#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:28,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#(< |ULTIMATE.start_main_~i~0#1| 1038)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1052#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:28,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {1059#(< |ULTIMATE.start_main_~i~0#1| 1037)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1052#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:28,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {1059#(< |ULTIMATE.start_main_~i~0#1| 1037)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1059#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:28,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 1036)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1059#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:28,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#(< |ULTIMATE.start_main_~i~0#1| 1036)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1066#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:28,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {1073#(< |ULTIMATE.start_main_~i~0#1| 1035)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1066#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:28,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {1073#(< |ULTIMATE.start_main_~i~0#1| 1035)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1073#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:28,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {1080#(< |ULTIMATE.start_main_~i~0#1| 1034)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1073#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:28,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {1080#(< |ULTIMATE.start_main_~i~0#1| 1034)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1080#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:28,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1087#(< |ULTIMATE.start_main_~i~0#1| 1033)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1080#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:28,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {1087#(< |ULTIMATE.start_main_~i~0#1| 1033)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1087#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:28,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#(< |ULTIMATE.start_main_~i~0#1| 1032)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1087#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:28,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {1094#(< |ULTIMATE.start_main_~i~0#1| 1032)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1094#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:28,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(< |ULTIMATE.start_main_~i~0#1| 1031)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1094#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:28,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(< |ULTIMATE.start_main_~i~0#1| 1031)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1101#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:28,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {1108#(< |ULTIMATE.start_main_~i~0#1| 1030)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1101#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:28,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(< |ULTIMATE.start_main_~i~0#1| 1030)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1108#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:28,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(< |ULTIMATE.start_main_~i~0#1| 1029)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1108#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:28,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(< |ULTIMATE.start_main_~i~0#1| 1029)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1115#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:28,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1122#(< |ULTIMATE.start_main_~i~0#1| 1028)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1115#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:28,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {1122#(< |ULTIMATE.start_main_~i~0#1| 1028)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1122#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:28,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1129#(< |ULTIMATE.start_main_~i~0#1| 1027)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1122#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:28,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {1129#(< |ULTIMATE.start_main_~i~0#1| 1027)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1129#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:28,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {1136#(< |ULTIMATE.start_main_~i~0#1| 1026)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1129#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:28,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#(< |ULTIMATE.start_main_~i~0#1| 1026)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1136#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:28,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {818#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {1136#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:28,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {818#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {818#true} is VALID [2022-02-21 03:23:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:28,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173177951] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:28,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:28,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-02-21 03:23:28,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979456231] [2022-02-21 03:23:28,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:28,019 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 5 times [2022-02-21 03:23:28,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:28,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331442396] [2022-02-21 03:23:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:28,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:28,027 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:28,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:28,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-21 03:23:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-21 03:23:28,104 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand has 49 states, 48 states have (on average 2.0) internal successors, (96), 49 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:23:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:28,294 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-02-21 03:23:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:23:28,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 2.0) internal successors, (96), 49 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:23:28,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:28,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:28,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 102 transitions. [2022-02-21 03:23:28,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:28,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:28,377 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-02-21 03:23:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-21 03:23:28,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:28,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states and 102 transitions. Second operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:23:28,380 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states and 102 transitions. Second operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:23:28,380 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:23:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:28,382 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-02-21 03:23:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:28,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:28,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 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 99 states and 102 transitions. [2022-02-21 03:23:28,386 INFO L87 Difference]: Start difference. First operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 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 99 states and 102 transitions. [2022-02-21 03:23:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:28,388 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-02-21 03:23:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:28,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:28,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:28,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 98 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:23:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-02-21 03:23:28,393 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-02-21 03:23:28,393 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-02-21 03:23:28,393 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:23:28,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 102 transitions. [2022-02-21 03:23:28,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:28,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:28,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:28,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1] [2022-02-21 03:23:28,398 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:28,399 INFO L791 eck$LassoCheckResult]: Stem: 1247#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 1250#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1251#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1252#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1253#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1254#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1342#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1341#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1340#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1339#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1338#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1337#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1336#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1335#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1334#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1333#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1332#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1331#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1330#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1329#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1328#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1327#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1326#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1325#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1324#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1323#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1322#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1321#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1320#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1319#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1318#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1317#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1316#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1315#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1314#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1313#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1312#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1311#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1310#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1309#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1308#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1307#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1306#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1305#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1304#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1303#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1302#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1301#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1300#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1299#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1298#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1297#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1296#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1295#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1294#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1293#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1292#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1291#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1290#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1289#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1288#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1287#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1286#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1285#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1284#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1283#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1282#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1281#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1280#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1279#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1278#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1277#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1276#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1275#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1274#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1273#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1272#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1271#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1270#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1269#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1268#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1267#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1266#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1265#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1264#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1263#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1262#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1261#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1260#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1259#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1258#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1257#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 1256#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1255#L14-3 assume !(main_~i~0#1 < 1048); 1244#L19-2 [2022-02-21 03:23:28,400 INFO L793 eck$LassoCheckResult]: Loop: 1244#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 1245#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 1246#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 1249#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1244#L19-2 [2022-02-21 03:23:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1497227703, now seen corresponding path program 5 times [2022-02-21 03:23:28,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:28,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769277188] [2022-02-21 03:23:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:29,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1544#true} is VALID [2022-02-21 03:23:29,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {1546#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:29,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1546#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1546#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:29,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {1546#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:29,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:29,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:29,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:29,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:29,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:29,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:29,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:29,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:29,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:29,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:29,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:29,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:29,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:29,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:29,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:29,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:29,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:29,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:29,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:29,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:29,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:29,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:29,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:29,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:29,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:29,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:29,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:29,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:29,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:29,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:29,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:29,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:29,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:29,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:29,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:29,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:29,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:29,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:29,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:29,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:29,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:29,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:29,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:29,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:29,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:29,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:29,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:29,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:29,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:29,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:29,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:29,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:29,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:29,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:29,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:29,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:29,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:29,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:29,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:29,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:29,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:29,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:29,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:29,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:29,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:29,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:29,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:29,436 INFO L290 TraceCheckUtils]: 71: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:29,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:29,436 INFO L290 TraceCheckUtils]: 73: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:29,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:29,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:29,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:29,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:29,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:29,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:29,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:29,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:29,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:29,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:29,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:29,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:29,440 INFO L290 TraceCheckUtils]: 86: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:29,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:29,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:29,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:29,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:29,442 INFO L290 TraceCheckUtils]: 91: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:29,442 INFO L290 TraceCheckUtils]: 92: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:29,443 INFO L290 TraceCheckUtils]: 93: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:29,443 INFO L290 TraceCheckUtils]: 94: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 1048); {1545#false} is VALID [2022-02-21 03:23:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:29,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:29,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769277188] [2022-02-21 03:23:29,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769277188] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:29,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836831348] [2022-02-21 03:23:29,445 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:23:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:29,446 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:23:29,447 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:23:32,095 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-21 03:23:32,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:32,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:23:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:32,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:32,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1544#true} is VALID [2022-02-21 03:23:32,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {1599#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:32,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1599#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:32,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:32,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:32,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:32,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:32,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:32,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:32,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:32,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:32,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:32,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:32,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:32,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:32,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {1552#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:32,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:32,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {1553#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:32,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:32,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1554#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:32,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:32,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {1555#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:32,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:32,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1556#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:32,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:32,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:32,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:32,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {1558#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:32,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:32,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {1559#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:32,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:32,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {1560#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:32,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:32,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {1561#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:32,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:32,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:32,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:32,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {1563#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:32,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:32,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {1564#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:32,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:32,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:32,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:32,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {1566#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:32,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:32,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {1567#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:32,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:32,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {1568#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:32,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:32,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {1569#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:32,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:32,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {1570#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:32,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:32,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {1571#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:32,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:32,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {1572#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:32,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:32,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {1573#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:32,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:32,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {1574#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:32,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:32,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {1575#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:32,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:32,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {1576#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:32,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:32,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:32,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:32,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:32,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:32,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:32,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:32,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:32,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:32,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:32,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:32,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:32,847 INFO L290 TraceCheckUtils]: 76: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:32,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:32,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:32,848 INFO L290 TraceCheckUtils]: 79: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:32,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:32,849 INFO L290 TraceCheckUtils]: 81: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:32,850 INFO L290 TraceCheckUtils]: 82: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:32,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:32,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:32,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:32,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:32,852 INFO L290 TraceCheckUtils]: 87: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:32,852 INFO L290 TraceCheckUtils]: 88: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:32,852 INFO L290 TraceCheckUtils]: 89: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:32,853 INFO L290 TraceCheckUtils]: 90: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:32,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:32,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:32,854 INFO L290 TraceCheckUtils]: 93: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:32,854 INFO L290 TraceCheckUtils]: 94: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 1048); {1545#false} is VALID [2022-02-21 03:23:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:32,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:35,432 INFO L290 TraceCheckUtils]: 94: Hoare triple {1879#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {1545#false} is VALID [2022-02-21 03:23:35,433 INFO L290 TraceCheckUtils]: 93: Hoare triple {1883#(< |ULTIMATE.start_main_~i~0#1| 1047)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1879#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:35,433 INFO L290 TraceCheckUtils]: 92: Hoare triple {1883#(< |ULTIMATE.start_main_~i~0#1| 1047)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1883#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:35,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {1890#(< |ULTIMATE.start_main_~i~0#1| 1046)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1883#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:35,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {1890#(< |ULTIMATE.start_main_~i~0#1| 1046)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1890#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:35,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {1897#(< |ULTIMATE.start_main_~i~0#1| 1045)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1890#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:35,435 INFO L290 TraceCheckUtils]: 88: Hoare triple {1897#(< |ULTIMATE.start_main_~i~0#1| 1045)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1897#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:35,435 INFO L290 TraceCheckUtils]: 87: Hoare triple {1904#(< |ULTIMATE.start_main_~i~0#1| 1044)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1897#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:35,435 INFO L290 TraceCheckUtils]: 86: Hoare triple {1904#(< |ULTIMATE.start_main_~i~0#1| 1044)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1904#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:35,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {1911#(< |ULTIMATE.start_main_~i~0#1| 1043)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1904#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:35,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {1911#(< |ULTIMATE.start_main_~i~0#1| 1043)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1911#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:35,436 INFO L290 TraceCheckUtils]: 83: Hoare triple {1918#(< |ULTIMATE.start_main_~i~0#1| 1042)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1911#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:35,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {1918#(< |ULTIMATE.start_main_~i~0#1| 1042)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1918#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:35,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {1925#(< |ULTIMATE.start_main_~i~0#1| 1041)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1918#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:35,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {1925#(< |ULTIMATE.start_main_~i~0#1| 1041)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1925#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:35,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {1932#(< |ULTIMATE.start_main_~i~0#1| 1040)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1925#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:35,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {1932#(< |ULTIMATE.start_main_~i~0#1| 1040)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1932#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:35,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {1939#(< |ULTIMATE.start_main_~i~0#1| 1039)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1932#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:35,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {1939#(< |ULTIMATE.start_main_~i~0#1| 1039)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1939#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:35,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {1946#(< |ULTIMATE.start_main_~i~0#1| 1038)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1939#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:35,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {1946#(< |ULTIMATE.start_main_~i~0#1| 1038)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1946#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:35,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {1953#(< |ULTIMATE.start_main_~i~0#1| 1037)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1946#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:35,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {1953#(< |ULTIMATE.start_main_~i~0#1| 1037)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1953#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:35,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {1960#(< |ULTIMATE.start_main_~i~0#1| 1036)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1953#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:35,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {1960#(< |ULTIMATE.start_main_~i~0#1| 1036)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1960#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:35,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {1967#(< |ULTIMATE.start_main_~i~0#1| 1035)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1960#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:35,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {1967#(< |ULTIMATE.start_main_~i~0#1| 1035)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1967#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:35,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {1974#(< |ULTIMATE.start_main_~i~0#1| 1034)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1967#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:35,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {1974#(< |ULTIMATE.start_main_~i~0#1| 1034)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1974#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:35,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {1981#(< |ULTIMATE.start_main_~i~0#1| 1033)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1974#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:35,443 INFO L290 TraceCheckUtils]: 64: Hoare triple {1981#(< |ULTIMATE.start_main_~i~0#1| 1033)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1981#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:35,443 INFO L290 TraceCheckUtils]: 63: Hoare triple {1988#(< |ULTIMATE.start_main_~i~0#1| 1032)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1981#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:35,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {1988#(< |ULTIMATE.start_main_~i~0#1| 1032)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1988#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:35,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {1995#(< |ULTIMATE.start_main_~i~0#1| 1031)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1988#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:35,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {1995#(< |ULTIMATE.start_main_~i~0#1| 1031)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {1995#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:35,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {2002#(< |ULTIMATE.start_main_~i~0#1| 1030)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {1995#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:35,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {2002#(< |ULTIMATE.start_main_~i~0#1| 1030)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2002#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:35,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {2009#(< |ULTIMATE.start_main_~i~0#1| 1029)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2002#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:35,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {2009#(< |ULTIMATE.start_main_~i~0#1| 1029)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2009#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:35,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 1028)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2009#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:35,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {2016#(< |ULTIMATE.start_main_~i~0#1| 1028)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2016#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:35,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {2023#(< |ULTIMATE.start_main_~i~0#1| 1027)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2016#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:35,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {2023#(< |ULTIMATE.start_main_~i~0#1| 1027)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2023#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:35,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {2030#(< |ULTIMATE.start_main_~i~0#1| 1026)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2023#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:35,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {2030#(< |ULTIMATE.start_main_~i~0#1| 1026)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2030#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:35,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {2037#(< |ULTIMATE.start_main_~i~0#1| 1025)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2030#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:35,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {2037#(< |ULTIMATE.start_main_~i~0#1| 1025)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2037#(< |ULTIMATE.start_main_~i~0#1| 1025)} is VALID [2022-02-21 03:23:35,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {2044#(< |ULTIMATE.start_main_~i~0#1| 1024)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2037#(< |ULTIMATE.start_main_~i~0#1| 1025)} is VALID [2022-02-21 03:23:35,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {2044#(< |ULTIMATE.start_main_~i~0#1| 1024)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2044#(< |ULTIMATE.start_main_~i~0#1| 1024)} is VALID [2022-02-21 03:23:35,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {2051#(< |ULTIMATE.start_main_~i~0#1| 1023)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2044#(< |ULTIMATE.start_main_~i~0#1| 1024)} is VALID [2022-02-21 03:23:35,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {2051#(< |ULTIMATE.start_main_~i~0#1| 1023)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2051#(< |ULTIMATE.start_main_~i~0#1| 1023)} is VALID [2022-02-21 03:23:35,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {2058#(< |ULTIMATE.start_main_~i~0#1| 1022)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2051#(< |ULTIMATE.start_main_~i~0#1| 1023)} is VALID [2022-02-21 03:23:35,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {2058#(< |ULTIMATE.start_main_~i~0#1| 1022)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2058#(< |ULTIMATE.start_main_~i~0#1| 1022)} is VALID [2022-02-21 03:23:35,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {2065#(< |ULTIMATE.start_main_~i~0#1| 1021)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2058#(< |ULTIMATE.start_main_~i~0#1| 1022)} is VALID [2022-02-21 03:23:35,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {2065#(< |ULTIMATE.start_main_~i~0#1| 1021)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2065#(< |ULTIMATE.start_main_~i~0#1| 1021)} is VALID [2022-02-21 03:23:35,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {2072#(< |ULTIMATE.start_main_~i~0#1| 1020)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2065#(< |ULTIMATE.start_main_~i~0#1| 1021)} is VALID [2022-02-21 03:23:35,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {2072#(< |ULTIMATE.start_main_~i~0#1| 1020)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2072#(< |ULTIMATE.start_main_~i~0#1| 1020)} is VALID [2022-02-21 03:23:35,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {2079#(< |ULTIMATE.start_main_~i~0#1| 1019)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2072#(< |ULTIMATE.start_main_~i~0#1| 1020)} is VALID [2022-02-21 03:23:35,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {2079#(< |ULTIMATE.start_main_~i~0#1| 1019)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2079#(< |ULTIMATE.start_main_~i~0#1| 1019)} is VALID [2022-02-21 03:23:35,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {2086#(< |ULTIMATE.start_main_~i~0#1| 1018)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2079#(< |ULTIMATE.start_main_~i~0#1| 1019)} is VALID [2022-02-21 03:23:35,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {2086#(< |ULTIMATE.start_main_~i~0#1| 1018)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2086#(< |ULTIMATE.start_main_~i~0#1| 1018)} is VALID [2022-02-21 03:23:35,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {2093#(< |ULTIMATE.start_main_~i~0#1| 1017)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2086#(< |ULTIMATE.start_main_~i~0#1| 1018)} is VALID [2022-02-21 03:23:35,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {2093#(< |ULTIMATE.start_main_~i~0#1| 1017)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2093#(< |ULTIMATE.start_main_~i~0#1| 1017)} is VALID [2022-02-21 03:23:35,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(< |ULTIMATE.start_main_~i~0#1| 1016)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2093#(< |ULTIMATE.start_main_~i~0#1| 1017)} is VALID [2022-02-21 03:23:35,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(< |ULTIMATE.start_main_~i~0#1| 1016)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2100#(< |ULTIMATE.start_main_~i~0#1| 1016)} is VALID [2022-02-21 03:23:35,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {2107#(< |ULTIMATE.start_main_~i~0#1| 1015)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2100#(< |ULTIMATE.start_main_~i~0#1| 1016)} is VALID [2022-02-21 03:23:35,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {2107#(< |ULTIMATE.start_main_~i~0#1| 1015)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2107#(< |ULTIMATE.start_main_~i~0#1| 1015)} is VALID [2022-02-21 03:23:35,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {2114#(< |ULTIMATE.start_main_~i~0#1| 1014)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2107#(< |ULTIMATE.start_main_~i~0#1| 1015)} is VALID [2022-02-21 03:23:35,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {2114#(< |ULTIMATE.start_main_~i~0#1| 1014)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2114#(< |ULTIMATE.start_main_~i~0#1| 1014)} is VALID [2022-02-21 03:23:35,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {2121#(< |ULTIMATE.start_main_~i~0#1| 1013)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2114#(< |ULTIMATE.start_main_~i~0#1| 1014)} is VALID [2022-02-21 03:23:35,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {2121#(< |ULTIMATE.start_main_~i~0#1| 1013)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2121#(< |ULTIMATE.start_main_~i~0#1| 1013)} is VALID [2022-02-21 03:23:35,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {2128#(< |ULTIMATE.start_main_~i~0#1| 1012)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2121#(< |ULTIMATE.start_main_~i~0#1| 1013)} is VALID [2022-02-21 03:23:35,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {2128#(< |ULTIMATE.start_main_~i~0#1| 1012)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2128#(< |ULTIMATE.start_main_~i~0#1| 1012)} is VALID [2022-02-21 03:23:35,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2135#(< |ULTIMATE.start_main_~i~0#1| 1011)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2128#(< |ULTIMATE.start_main_~i~0#1| 1012)} is VALID [2022-02-21 03:23:35,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {2135#(< |ULTIMATE.start_main_~i~0#1| 1011)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2135#(< |ULTIMATE.start_main_~i~0#1| 1011)} is VALID [2022-02-21 03:23:35,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2142#(< |ULTIMATE.start_main_~i~0#1| 1010)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2135#(< |ULTIMATE.start_main_~i~0#1| 1011)} is VALID [2022-02-21 03:23:35,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {2142#(< |ULTIMATE.start_main_~i~0#1| 1010)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2142#(< |ULTIMATE.start_main_~i~0#1| 1010)} is VALID [2022-02-21 03:23:35,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#(< |ULTIMATE.start_main_~i~0#1| 1009)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2142#(< |ULTIMATE.start_main_~i~0#1| 1010)} is VALID [2022-02-21 03:23:35,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {2149#(< |ULTIMATE.start_main_~i~0#1| 1009)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2149#(< |ULTIMATE.start_main_~i~0#1| 1009)} is VALID [2022-02-21 03:23:35,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {2156#(< |ULTIMATE.start_main_~i~0#1| 1008)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2149#(< |ULTIMATE.start_main_~i~0#1| 1009)} is VALID [2022-02-21 03:23:35,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(< |ULTIMATE.start_main_~i~0#1| 1008)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2156#(< |ULTIMATE.start_main_~i~0#1| 1008)} is VALID [2022-02-21 03:23:35,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {2163#(< |ULTIMATE.start_main_~i~0#1| 1007)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2156#(< |ULTIMATE.start_main_~i~0#1| 1008)} is VALID [2022-02-21 03:23:35,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {2163#(< |ULTIMATE.start_main_~i~0#1| 1007)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2163#(< |ULTIMATE.start_main_~i~0#1| 1007)} is VALID [2022-02-21 03:23:35,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(< |ULTIMATE.start_main_~i~0#1| 1006)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2163#(< |ULTIMATE.start_main_~i~0#1| 1007)} is VALID [2022-02-21 03:23:35,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(< |ULTIMATE.start_main_~i~0#1| 1006)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2170#(< |ULTIMATE.start_main_~i~0#1| 1006)} is VALID [2022-02-21 03:23:35,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {2177#(< |ULTIMATE.start_main_~i~0#1| 1005)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2170#(< |ULTIMATE.start_main_~i~0#1| 1006)} is VALID [2022-02-21 03:23:35,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {2177#(< |ULTIMATE.start_main_~i~0#1| 1005)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2177#(< |ULTIMATE.start_main_~i~0#1| 1005)} is VALID [2022-02-21 03:23:35,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {2184#(< |ULTIMATE.start_main_~i~0#1| 1004)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2177#(< |ULTIMATE.start_main_~i~0#1| 1005)} is VALID [2022-02-21 03:23:35,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {2184#(< |ULTIMATE.start_main_~i~0#1| 1004)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2184#(< |ULTIMATE.start_main_~i~0#1| 1004)} is VALID [2022-02-21 03:23:35,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {2191#(< |ULTIMATE.start_main_~i~0#1| 1003)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2184#(< |ULTIMATE.start_main_~i~0#1| 1004)} is VALID [2022-02-21 03:23:35,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {2191#(< |ULTIMATE.start_main_~i~0#1| 1003)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2191#(< |ULTIMATE.start_main_~i~0#1| 1003)} is VALID [2022-02-21 03:23:35,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {2198#(< |ULTIMATE.start_main_~i~0#1| 1002)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2191#(< |ULTIMATE.start_main_~i~0#1| 1003)} is VALID [2022-02-21 03:23:35,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#(< |ULTIMATE.start_main_~i~0#1| 1002)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2198#(< |ULTIMATE.start_main_~i~0#1| 1002)} is VALID [2022-02-21 03:23:35,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {2198#(< |ULTIMATE.start_main_~i~0#1| 1002)} is VALID [2022-02-21 03:23:35,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1544#true} is VALID [2022-02-21 03:23:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:35,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836831348] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:35,480 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:35,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-02-21 03:23:35,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627621940] [2022-02-21 03:23:35,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:35,481 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1511655, now seen corresponding path program 6 times [2022-02-21 03:23:35,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:35,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690511175] [2022-02-21 03:23:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:35,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:35,497 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:35,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:35,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-21 03:23:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-21 03:23:35,567 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. cyclomatic complexity: 5 Second operand has 97 states, 96 states have (on average 2.0) internal successors, (192), 97 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:23:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:35,968 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2022-02-21 03:23:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:23:35,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 96 states have (on average 2.0) internal successors, (192), 97 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have 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:23:36,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:36,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:36,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 198 transitions. [2022-02-21 03:23:36,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:23:36,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:36,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:36,142 INFO L681 BuchiCegarLoop]: Abstraction has 195 states and 198 transitions. [2022-02-21 03:23:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-02-21 03:23:36,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:36,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states and 198 transitions. Second operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:23:36,147 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states and 198 transitions. Second operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:23:36,147 INFO L87 Difference]: Start difference. First operand 195 states and 198 transitions. Second operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:23:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:36,160 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2022-02-21 03:23:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:36,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:36,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 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 195 states and 198 transitions. [2022-02-21 03:23:36,166 INFO L87 Difference]: Start difference. First operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 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 195 states and 198 transitions. [2022-02-21 03:23:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:36,172 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2022-02-21 03:23:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:36,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:36,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:36,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.0153846153846153) internal successors, (198), 194 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:23:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 198 transitions. [2022-02-21 03:23:36,180 INFO L704 BuchiCegarLoop]: Abstraction has 195 states and 198 transitions. [2022-02-21 03:23:36,180 INFO L587 BuchiCegarLoop]: Abstraction has 195 states and 198 transitions. [2022-02-21 03:23:36,180 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:23:36,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 198 transitions. [2022-02-21 03:23:36,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:36,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:36,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:36,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1] [2022-02-21 03:23:36,189 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:36,191 INFO L791 eck$LassoCheckResult]: Stem: 2405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 2408#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2409#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2410#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2411#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2412#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2596#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2595#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2594#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2593#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2592#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2591#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2590#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2589#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2588#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2587#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2586#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2585#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2584#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2583#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2582#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2581#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2580#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2579#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2578#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2577#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2576#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2575#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2574#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2573#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2572#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2571#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2570#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2569#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2568#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2567#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2566#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2565#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2564#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2563#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2562#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2561#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2560#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2559#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2558#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2557#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2556#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2555#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2554#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2553#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2552#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2551#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2550#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2549#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2548#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2547#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2546#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2545#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2544#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2543#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2542#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2541#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2540#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2539#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2538#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2537#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2536#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2535#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2534#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2533#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2532#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2531#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2530#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2529#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2528#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2527#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2526#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2525#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2524#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2523#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2522#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2521#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2520#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2519#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2518#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2517#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2516#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2515#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2514#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2513#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2512#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2511#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2510#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2509#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2508#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2507#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2506#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2505#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2504#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2503#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2502#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2501#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2500#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2499#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2498#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2497#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2496#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2495#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2494#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2493#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2492#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2491#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2490#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2489#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2488#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2487#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2486#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2485#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2484#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2483#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2482#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2481#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2480#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2479#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2478#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2477#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2476#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2475#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2474#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2473#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2472#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2471#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2470#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2469#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2468#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2467#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2466#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2465#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2464#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2463#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2462#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2461#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2460#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2459#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2458#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2457#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2456#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2455#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2454#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2453#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2452#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2451#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2450#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2449#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2448#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2447#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2446#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2445#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2444#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2443#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2442#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2441#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2440#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2439#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2438#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2437#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2436#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2435#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2434#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2433#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2432#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2431#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2430#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2429#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2428#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2427#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2426#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2425#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2424#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2423#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2422#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2421#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2420#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2419#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2418#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2417#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2416#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2415#L14-3 assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; 2414#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2413#L14-3 assume !(main_~i~0#1 < 1048); 2402#L19-2 [2022-02-21 03:23:36,191 INFO L793 eck$LassoCheckResult]: Loop: 2402#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 2403#L18 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 2404#L18-2 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1; 2407#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2402#L19-2 [2022-02-21 03:23:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2115802601, now seen corresponding path program 6 times [2022-02-21 03:23:36,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:36,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579562269] [2022-02-21 03:23:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:39,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2990#true} is VALID [2022-02-21 03:23:39,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; {2992#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:39,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {2992#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2992#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:39,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {2992#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2993#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:39,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {2993#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2993#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:39,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2994#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:39,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2994#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2994#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:39,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2995#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:39,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2995#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2995#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:39,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2995#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2996#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:39,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {2996#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2996#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:39,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2996#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2997#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:39,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2997#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:39,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2998#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:39,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2998#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:39,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {2998#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {2999#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:39,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {2999#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:39,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3000#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:39,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {3000#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3000#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:39,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {3000#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3001#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:39,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {3001#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3001#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:39,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {3001#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3002#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:39,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3002#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:39,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3003#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:39,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {3003#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3003#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:39,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {3003#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3004#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:39,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {3004#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3004#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:39,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {3004#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3005#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:39,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {3005#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3005#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:39,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {3005#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3006#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:39,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {3006#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3006#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:39,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {3006#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3007#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:39,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {3007#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3007#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:39,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {3007#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3008#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:39,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {3008#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3008#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:39,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {3008#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3009#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:39,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {3009#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3009#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:39,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {3009#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3010#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:39,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {3010#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3010#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:39,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {3010#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3011#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:39,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {3011#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3011#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:39,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {3011#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3012#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:39,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {3012#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3012#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:39,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {3012#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3013#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:39,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {3013#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3013#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:39,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {3013#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3014#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:39,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {3014#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3014#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:39,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {3014#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3015#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:39,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {3015#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3015#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:39,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {3015#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3016#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:39,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {3016#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3016#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:39,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {3016#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3017#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:39,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {3017#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3017#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:39,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {3017#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3018#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:39,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {3018#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3018#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:39,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {3018#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3019#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:39,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {3019#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3019#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:39,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {3019#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3020#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:39,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {3020#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3020#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:39,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {3020#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3021#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:39,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {3021#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3021#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:39,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {3021#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3022#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:39,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {3022#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3022#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:39,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {3022#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3023#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:39,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {3023#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3023#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:39,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {3023#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3024#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:39,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {3024#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3024#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:39,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {3024#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3025#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:39,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {3025#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3025#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:39,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {3025#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3026#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:39,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {3026#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3026#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:39,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {3026#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3027#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:39,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {3027#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3027#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:39,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {3027#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3028#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:39,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {3028#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3028#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:39,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {3028#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3029#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:39,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {3029#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3029#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:39,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {3029#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3030#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:39,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {3030#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3030#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:39,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {3030#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3031#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:39,369 INFO L290 TraceCheckUtils]: 80: Hoare triple {3031#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3031#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:39,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {3031#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3032#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:39,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {3032#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3032#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:39,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {3032#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3033#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:39,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {3033#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3033#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:39,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {3033#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3034#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:39,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {3034#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3034#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:39,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {3034#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3035#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:39,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {3035#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3035#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:39,372 INFO L290 TraceCheckUtils]: 89: Hoare triple {3035#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3036#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:39,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {3036#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3036#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:39,372 INFO L290 TraceCheckUtils]: 91: Hoare triple {3036#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3037#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:39,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {3037#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3037#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:39,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {3037#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3038#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:39,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {3038#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3038#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:39,374 INFO L290 TraceCheckUtils]: 95: Hoare triple {3038#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3039#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:23:39,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {3039#(<= |ULTIMATE.start_main_~i~0#1| 47)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3039#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:23:39,374 INFO L290 TraceCheckUtils]: 97: Hoare triple {3039#(<= |ULTIMATE.start_main_~i~0#1| 47)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3040#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:23:39,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {3040#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3040#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:23:39,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {3040#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3041#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:23:39,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {3041#(<= |ULTIMATE.start_main_~i~0#1| 49)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3041#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:23:39,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {3041#(<= |ULTIMATE.start_main_~i~0#1| 49)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3042#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:23:39,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {3042#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3042#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:23:39,376 INFO L290 TraceCheckUtils]: 103: Hoare triple {3042#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3043#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:23:39,376 INFO L290 TraceCheckUtils]: 104: Hoare triple {3043#(<= |ULTIMATE.start_main_~i~0#1| 51)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3043#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:23:39,377 INFO L290 TraceCheckUtils]: 105: Hoare triple {3043#(<= |ULTIMATE.start_main_~i~0#1| 51)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3044#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:23:39,377 INFO L290 TraceCheckUtils]: 106: Hoare triple {3044#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3044#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:23:39,377 INFO L290 TraceCheckUtils]: 107: Hoare triple {3044#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3045#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:23:39,378 INFO L290 TraceCheckUtils]: 108: Hoare triple {3045#(<= |ULTIMATE.start_main_~i~0#1| 53)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3045#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:23:39,378 INFO L290 TraceCheckUtils]: 109: Hoare triple {3045#(<= |ULTIMATE.start_main_~i~0#1| 53)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3046#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:23:39,378 INFO L290 TraceCheckUtils]: 110: Hoare triple {3046#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3046#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:23:39,378 INFO L290 TraceCheckUtils]: 111: Hoare triple {3046#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3047#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:23:39,379 INFO L290 TraceCheckUtils]: 112: Hoare triple {3047#(<= |ULTIMATE.start_main_~i~0#1| 55)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3047#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:23:39,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {3047#(<= |ULTIMATE.start_main_~i~0#1| 55)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3048#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:23:39,379 INFO L290 TraceCheckUtils]: 114: Hoare triple {3048#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3048#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:23:39,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {3048#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3049#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:23:39,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {3049#(<= |ULTIMATE.start_main_~i~0#1| 57)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3049#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:23:39,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {3049#(<= |ULTIMATE.start_main_~i~0#1| 57)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3050#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:23:39,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {3050#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3050#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:23:39,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {3050#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3051#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:23:39,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {3051#(<= |ULTIMATE.start_main_~i~0#1| 59)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3051#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:23:39,382 INFO L290 TraceCheckUtils]: 121: Hoare triple {3051#(<= |ULTIMATE.start_main_~i~0#1| 59)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3052#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:23:39,382 INFO L290 TraceCheckUtils]: 122: Hoare triple {3052#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3052#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:23:39,382 INFO L290 TraceCheckUtils]: 123: Hoare triple {3052#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3053#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:23:39,382 INFO L290 TraceCheckUtils]: 124: Hoare triple {3053#(<= |ULTIMATE.start_main_~i~0#1| 61)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3053#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:23:39,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {3053#(<= |ULTIMATE.start_main_~i~0#1| 61)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3054#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:23:39,383 INFO L290 TraceCheckUtils]: 126: Hoare triple {3054#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3054#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:23:39,383 INFO L290 TraceCheckUtils]: 127: Hoare triple {3054#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3055#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:23:39,384 INFO L290 TraceCheckUtils]: 128: Hoare triple {3055#(<= |ULTIMATE.start_main_~i~0#1| 63)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3055#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:23:39,384 INFO L290 TraceCheckUtils]: 129: Hoare triple {3055#(<= |ULTIMATE.start_main_~i~0#1| 63)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3056#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:23:39,384 INFO L290 TraceCheckUtils]: 130: Hoare triple {3056#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3056#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:23:39,385 INFO L290 TraceCheckUtils]: 131: Hoare triple {3056#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3057#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:23:39,385 INFO L290 TraceCheckUtils]: 132: Hoare triple {3057#(<= |ULTIMATE.start_main_~i~0#1| 65)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3057#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:23:39,385 INFO L290 TraceCheckUtils]: 133: Hoare triple {3057#(<= |ULTIMATE.start_main_~i~0#1| 65)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3058#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:23:39,385 INFO L290 TraceCheckUtils]: 134: Hoare triple {3058#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3058#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:23:39,386 INFO L290 TraceCheckUtils]: 135: Hoare triple {3058#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3059#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:23:39,386 INFO L290 TraceCheckUtils]: 136: Hoare triple {3059#(<= |ULTIMATE.start_main_~i~0#1| 67)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3059#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:23:39,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {3059#(<= |ULTIMATE.start_main_~i~0#1| 67)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3060#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:23:39,387 INFO L290 TraceCheckUtils]: 138: Hoare triple {3060#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3060#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:23:39,387 INFO L290 TraceCheckUtils]: 139: Hoare triple {3060#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3061#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:23:39,387 INFO L290 TraceCheckUtils]: 140: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 69)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3061#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:23:39,388 INFO L290 TraceCheckUtils]: 141: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 69)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3062#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:23:39,388 INFO L290 TraceCheckUtils]: 142: Hoare triple {3062#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3062#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:23:39,388 INFO L290 TraceCheckUtils]: 143: Hoare triple {3062#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3063#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:23:39,389 INFO L290 TraceCheckUtils]: 144: Hoare triple {3063#(<= |ULTIMATE.start_main_~i~0#1| 71)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3063#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:23:39,389 INFO L290 TraceCheckUtils]: 145: Hoare triple {3063#(<= |ULTIMATE.start_main_~i~0#1| 71)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3064#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:23:39,389 INFO L290 TraceCheckUtils]: 146: Hoare triple {3064#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3064#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:23:39,389 INFO L290 TraceCheckUtils]: 147: Hoare triple {3064#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3065#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:23:39,390 INFO L290 TraceCheckUtils]: 148: Hoare triple {3065#(<= |ULTIMATE.start_main_~i~0#1| 73)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3065#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:23:39,390 INFO L290 TraceCheckUtils]: 149: Hoare triple {3065#(<= |ULTIMATE.start_main_~i~0#1| 73)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3066#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:23:39,390 INFO L290 TraceCheckUtils]: 150: Hoare triple {3066#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3066#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:23:39,391 INFO L290 TraceCheckUtils]: 151: Hoare triple {3066#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3067#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:23:39,391 INFO L290 TraceCheckUtils]: 152: Hoare triple {3067#(<= |ULTIMATE.start_main_~i~0#1| 75)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3067#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:23:39,391 INFO L290 TraceCheckUtils]: 153: Hoare triple {3067#(<= |ULTIMATE.start_main_~i~0#1| 75)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3068#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:23:39,392 INFO L290 TraceCheckUtils]: 154: Hoare triple {3068#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3068#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:23:39,392 INFO L290 TraceCheckUtils]: 155: Hoare triple {3068#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3069#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:23:39,392 INFO L290 TraceCheckUtils]: 156: Hoare triple {3069#(<= |ULTIMATE.start_main_~i~0#1| 77)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3069#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:23:39,393 INFO L290 TraceCheckUtils]: 157: Hoare triple {3069#(<= |ULTIMATE.start_main_~i~0#1| 77)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3070#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:23:39,393 INFO L290 TraceCheckUtils]: 158: Hoare triple {3070#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3070#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:23:39,393 INFO L290 TraceCheckUtils]: 159: Hoare triple {3070#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:23:39,393 INFO L290 TraceCheckUtils]: 160: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 79)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:23:39,394 INFO L290 TraceCheckUtils]: 161: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 79)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3072#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:23:39,394 INFO L290 TraceCheckUtils]: 162: Hoare triple {3072#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3072#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:23:39,394 INFO L290 TraceCheckUtils]: 163: Hoare triple {3072#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3073#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:23:39,395 INFO L290 TraceCheckUtils]: 164: Hoare triple {3073#(<= |ULTIMATE.start_main_~i~0#1| 81)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3073#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:23:39,395 INFO L290 TraceCheckUtils]: 165: Hoare triple {3073#(<= |ULTIMATE.start_main_~i~0#1| 81)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3074#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:23:39,395 INFO L290 TraceCheckUtils]: 166: Hoare triple {3074#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3074#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:23:39,396 INFO L290 TraceCheckUtils]: 167: Hoare triple {3074#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3075#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:23:39,396 INFO L290 TraceCheckUtils]: 168: Hoare triple {3075#(<= |ULTIMATE.start_main_~i~0#1| 83)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3075#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:23:39,396 INFO L290 TraceCheckUtils]: 169: Hoare triple {3075#(<= |ULTIMATE.start_main_~i~0#1| 83)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3076#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:23:39,396 INFO L290 TraceCheckUtils]: 170: Hoare triple {3076#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3076#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:23:39,397 INFO L290 TraceCheckUtils]: 171: Hoare triple {3076#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3077#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:23:39,397 INFO L290 TraceCheckUtils]: 172: Hoare triple {3077#(<= |ULTIMATE.start_main_~i~0#1| 85)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3077#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:23:39,397 INFO L290 TraceCheckUtils]: 173: Hoare triple {3077#(<= |ULTIMATE.start_main_~i~0#1| 85)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3078#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:23:39,398 INFO L290 TraceCheckUtils]: 174: Hoare triple {3078#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3078#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:23:39,398 INFO L290 TraceCheckUtils]: 175: Hoare triple {3078#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3079#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:23:39,398 INFO L290 TraceCheckUtils]: 176: Hoare triple {3079#(<= |ULTIMATE.start_main_~i~0#1| 87)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3079#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:23:39,399 INFO L290 TraceCheckUtils]: 177: Hoare triple {3079#(<= |ULTIMATE.start_main_~i~0#1| 87)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3080#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:23:39,399 INFO L290 TraceCheckUtils]: 178: Hoare triple {3080#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3080#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:23:39,399 INFO L290 TraceCheckUtils]: 179: Hoare triple {3080#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:23:39,400 INFO L290 TraceCheckUtils]: 180: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 89)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:23:39,400 INFO L290 TraceCheckUtils]: 181: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 89)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3082#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:23:39,400 INFO L290 TraceCheckUtils]: 182: Hoare triple {3082#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3082#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:23:39,400 INFO L290 TraceCheckUtils]: 183: Hoare triple {3082#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3083#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:23:39,401 INFO L290 TraceCheckUtils]: 184: Hoare triple {3083#(<= |ULTIMATE.start_main_~i~0#1| 91)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3083#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:23:39,401 INFO L290 TraceCheckUtils]: 185: Hoare triple {3083#(<= |ULTIMATE.start_main_~i~0#1| 91)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3084#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:23:39,401 INFO L290 TraceCheckUtils]: 186: Hoare triple {3084#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3084#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:23:39,402 INFO L290 TraceCheckUtils]: 187: Hoare triple {3084#(<= |ULTIMATE.start_main_~i~0#1| 92)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3085#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:23:39,402 INFO L290 TraceCheckUtils]: 188: Hoare triple {3085#(<= |ULTIMATE.start_main_~i~0#1| 93)} assume !!(main_~i~0#1 < 1048);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1; {3085#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:23:39,402 INFO L290 TraceCheckUtils]: 189: Hoare triple {3085#(<= |ULTIMATE.start_main_~i~0#1| 93)} main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; {3086#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:23:39,403 INFO L290 TraceCheckUtils]: 190: Hoare triple {3086#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(main_~i~0#1 < 1048); {2991#false} is VALID [2022-02-21 03:23:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:39,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:39,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579562269] [2022-02-21 03:23:39,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579562269] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:39,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765480291] [2022-02-21 03:23:39,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:23:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:39,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:39,407 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:23:39,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process