./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-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/Arrays01-EquivalentConstantIndices-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 cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:10,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:10,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:11,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:11,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:11,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:11,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:11,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:11,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:11,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:11,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:11,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:11,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:11,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:11,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:11,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:11,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:11,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:11,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:11,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:11,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:11,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:11,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:11,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:11,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:11,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:11,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:11,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:11,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:11,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:11,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:11,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:11,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:11,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:11,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:11,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:11,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:11,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:11,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:11,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:11,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:11,067 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:11,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:11,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:11,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:11,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:11,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:11,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:11,096 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:11,096 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:11,096 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:11,096 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:11,097 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:11,098 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:11,098 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:11,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:11,098 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:11,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:11,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:11,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:11,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:11,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:11,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:11,100 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:11,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:11,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:11,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:11,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:11,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:11,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:11,102 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:11,103 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 -> cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf [2022-02-21 03:23:11,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:11,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:11,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:11,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:11,410 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:11,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2022-02-21 03:23:11,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3182f26fb/777734a4417e4821b84f74d00b3490c2/FLAG68ad20d3a [2022-02-21 03:23:11,894 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:11,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2022-02-21 03:23:11,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3182f26fb/777734a4417e4821b84f74d00b3490c2/FLAG68ad20d3a [2022-02-21 03:23:11,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3182f26fb/777734a4417e4821b84f74d00b3490c2 [2022-02-21 03:23:11,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:11,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:11,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:11,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:11,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:11,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1485d2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11, skipping insertion in model container [2022-02-21 03:23:11,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:11,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:12,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:12,057 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:12,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:12,104 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:12,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12 WrapperNode [2022-02-21 03:23:12,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:12,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:12,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:12,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:12,117 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:12" (1/1) ... [2022-02-21 03:23:12,124 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:12" (1/1) ... [2022-02-21 03:23:12,139 INFO L137 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-02-21 03:23:12,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:12,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:12,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:12,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:12,148 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:12" (1/1) ... [2022-02-21 03:23:12,148 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:12" (1/1) ... [2022-02-21 03:23:12,159 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:12" (1/1) ... [2022-02-21 03:23:12,160 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:12" (1/1) ... [2022-02-21 03:23:12,172 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:12" (1/1) ... [2022-02-21 03:23:12,175 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:12" (1/1) ... [2022-02-21 03:23:12,176 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:12" (1/1) ... [2022-02-21 03:23:12,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:12,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:12,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:12,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:12,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (1/1) ... [2022-02-21 03:23:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:12,210 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:12,212 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:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:23:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:23:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:23:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:23:12,288 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:12,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:12,437 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:12,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:12,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:23:12,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12 BoogieIcfgContainer [2022-02-21 03:23:12,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:12,446 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:12,446 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:12,449 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:12,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:11" (1/3) ... [2022-02-21 03:23:12,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@494266e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:12" (2/3) ... [2022-02-21 03:23:12,452 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@494266e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,452 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12" (3/3) ... [2022-02-21 03:23:12,454 INFO L388 chiAutomizerObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2022-02-21 03:23:12,493 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:12,493 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:12,494 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:12,494 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:12,494 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:12,494 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:12,494 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:12,494 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:12,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:12,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:12,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,528 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:12,528 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:12,528 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:12,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:12,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:12,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,532 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:12,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:12,538 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; 9#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 8#L13-3true [2022-02-21 03:23:12,538 INFO L793 eck$LassoCheckResult]: Loop: 8#L13-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; 7#L13-2true main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 8#L13-3true [2022-02-21 03:23:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:23:12,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705571547] [2022-02-21 03:23:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,771 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:23:12,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245415793] [2022-02-21 03:23:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,824 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:23:12,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259184959] [2022-02-21 03:23:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,906 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:13,168 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:13,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:13,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:13,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:13,170 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:13,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:13,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:13,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: Arrays01-EquivalentConstantIndices-1.c_Iteration1_Lasso [2022-02-21 03:23:13,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:13,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:13,188 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:13,197 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:13,202 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:13,315 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:13,318 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:13,321 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:13,323 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:13,499 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:13,503 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:13,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,506 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:13,508 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:13,509 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:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:13,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:13,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:13,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,568 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:13,570 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:13,571 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:13,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:13,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:13,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:13,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:13,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,621 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:13,623 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:13,624 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:13,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:13,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:13,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,678 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:13,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,680 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:13,686 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:13,687 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:13,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:13,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:13,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,745 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:13,746 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:13,748 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:13,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:13,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:13,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,802 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:13,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,804 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:13,805 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:13,806 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:13,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:13,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:13,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:13,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:13,856 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:13,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,859 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:13,866 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:13,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:13,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:13,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:13,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:13,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:13,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:13,886 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:13,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:13,923 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:23:13,924 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:23:13,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:13,931 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:13,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:13,936 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:13,954 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:23:13,954 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:13,955 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:13,978 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:13,997 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:23:14,004 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:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:23:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:14,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {20#unseeded} is VALID [2022-02-21 03:23:14,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {20#unseeded} is VALID [2022-02-21 03:23:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:14,147 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:14,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#(>= 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; {46#(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:14,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(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; {38#(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:14,199 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:14,241 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:14,250 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:14,252 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:14,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,258 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:14,259 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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 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:14,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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 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 22 states and 31 transitions. Complement of second has 8 states. [2022-02-21 03:23:14,345 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:14,346 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:14,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:14,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:14,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,352 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:14,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:14,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-02-21 03:23:14,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,361 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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:14,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:14,364 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:23:14,364 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:14,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:14,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:23:14,369 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2022-02-21 03:23:14,369 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:23:14,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:14,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,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:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,374 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:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,376 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 2 letters. [2022-02-21 03:23:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,377 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 22 letters. Loop has 22 letters. [2022-02-21 03:23:14,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:14,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:14,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,378 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 10 letters. Loop has 10 letters. [2022-02-21 03:23:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,379 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:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,380 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 2 letters. [2022-02-21 03:23:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:14,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,381 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:14,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:14,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,382 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:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:14,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,383 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:14,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:14,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:14,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,384 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:14,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:14,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:14,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,385 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:14,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:14,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,386 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 2 letters. [2022-02-21 03:23:14,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:23:14,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,387 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 2 letters. [2022-02-21 03:23:14,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:23:14,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,388 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:14,392 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:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:23:14,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:14,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:14,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:23:14,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:14,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2022-02-21 03:23:14,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 8 states and 10 transitions. [2022-02-21 03:23:14,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:14,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:23:14,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-02-21 03:23:14,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:14,401 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:23:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-02-21 03:23:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:23:14,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:14,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:14,423 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:14,425 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,428 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:23:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:23:14,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 8 states and 10 transitions. [2022-02-21 03:23:14,429 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 8 states and 10 transitions. [2022-02-21 03:23:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,430 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:23:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:23:14,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:14,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2022-02-21 03:23:14,432 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:23:14,432 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:23:14,433 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:14,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:23:14,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:14,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:14,434 INFO L791 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 86#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 89#L13-3 assume !(main_~i~0#1 < 1048); 84#L17-2 [2022-02-21 03:23:14,434 INFO L793 eck$LassoCheckResult]: Loop: 84#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 83#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 84#L17-2 [2022-02-21 03:23:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-02-21 03:23:14,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:14,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297405359] [2022-02-21 03:23:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {109#true} is VALID [2022-02-21 03:23:14,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {111#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:14,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 1048); {110#false} is VALID [2022-02-21 03:23:14,470 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:14,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:14,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297405359] [2022-02-21 03:23:14,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297405359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:14,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:14,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:23:14,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972650848] [2022-02-21 03:23:14,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:14,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2022-02-21 03:23:14,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:14,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956114824] [2022-02-21 03:23:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:14,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:14,489 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:14,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:23:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:23:14,534 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 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:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,554 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:23:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:23:14,555 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:14,560 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:14,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2022-02-21 03:23:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2022-02-21 03:23:14,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:14,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:14,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-02-21 03:23:14,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:14,562 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:23:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-02-21 03:23:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:23:14,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:14,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:14,563 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:14,563 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,564 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:23:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:23:14,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 states and 9 transitions. [2022-02-21 03:23:14,565 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 states and 9 transitions. [2022-02-21 03:23:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,565 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:23:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:23:14,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:14,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:23:14,567 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:23:14,567 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:23:14,567 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:14,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:23:14,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:14,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:14,568 INFO L791 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 125#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 128#L13-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; 126#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 127#L13-3 assume !(main_~i~0#1 < 1048); 122#L17-2 [2022-02-21 03:23:14,569 INFO L793 eck$LassoCheckResult]: Loop: 122#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 123#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 122#L17-2 [2022-02-21 03:23:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-02-21 03:23:14,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:14,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419771697] [2022-02-21 03:23:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2022-02-21 03:23:14,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {150#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:14,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#(= |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; {150#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:14,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(= |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; {151#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:14,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {149#false} is VALID [2022-02-21 03:23:14,601 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:14,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:14,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419771697] [2022-02-21 03:23:14,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419771697] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:14,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92139032] [2022-02-21 03:23:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:14,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:14,604 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:14,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:23:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:23:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:14,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:14,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2022-02-21 03:23:14,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {158#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:14,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#(<= |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; {158#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:14,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {158#(<= |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; {151#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:14,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 1048); {149#false} is VALID [2022-02-21 03:23:14,701 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:14,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:14,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {149#false} is VALID [2022-02-21 03:23:14,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(< |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; {168#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:14,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#(< |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; {172#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:14,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {172#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:14,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2022-02-21 03:23:14,770 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:14,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92139032] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:14,771 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:14,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 03:23:14,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000013541] [2022-02-21 03:23:14,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:14,772 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times [2022-02-21 03:23:14,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:14,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778715898] [2022-02-21 03:23:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:14,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:14,815 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:14,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:23:14,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:23:14,861 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 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:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,907 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:23:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:23:14,908 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:14,924 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:14,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:23:14,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:14,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:14,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:14,927 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:23:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:23:14,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:14,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:14,929 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:14,929 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,930 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:23:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 14 transitions. [2022-02-21 03:23:14,931 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 14 transitions. [2022-02-21 03:23:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:14,932 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:23:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:14,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:14,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:14,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:23:14,934 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:23:14,934 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:23:14,934 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:14,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:23:14,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:14,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:14,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:14,935 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-02-21 03:23:14,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:14,935 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 200#L13-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; 198#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 199#L13-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; 201#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 206#L13-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; 205#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 204#L13-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; 203#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 202#L13-3 assume !(main_~i~0#1 < 1048); 194#L17-2 [2022-02-21 03:23:14,936 INFO L793 eck$LassoCheckResult]: Loop: 194#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 195#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 194#L17-2 [2022-02-21 03:23:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-02-21 03:23:14,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:14,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200842279] [2022-02-21 03:23:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {236#true} is VALID [2022-02-21 03:23:15,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {238#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#(= |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; {238#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {238#(= |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; {239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#(<= |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; {239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#(<= |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; {240#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#(<= |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; {240#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(<= |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; {241#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(<= |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; {241#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(<= |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; {242#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:15,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {237#false} is VALID [2022-02-21 03:23:15,024 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:15,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:15,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200842279] [2022-02-21 03:23:15,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200842279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:15,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719663981] [2022-02-21 03:23:15,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,027 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:15,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:23:15,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:15,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:15,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:15,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {236#true} is VALID [2022-02-21 03:23:15,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {249#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#(<= |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; {249#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#(<= |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; {239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#(<= |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; {239#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#(<= |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; {240#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#(<= |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; {240#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(<= |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; {241#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(<= |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; {241#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(<= |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; {242#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:15,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 1048); {237#false} is VALID [2022-02-21 03:23:15,214 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:15,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:15,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {277#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {237#false} is VALID [2022-02-21 03:23:15,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(< |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; {277#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:15,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(< |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; {281#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:15,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(< |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; {281#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:15,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#(< |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; {288#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:15,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#(< |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; {288#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:15,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {295#(< |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; {295#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:15,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#(< |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; {295#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:15,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#(< |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; {302#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:15,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {302#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:15,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {236#true} is VALID [2022-02-21 03:23:15,375 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:15,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719663981] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:15,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:15,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-02-21 03:23:15,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896427814] [2022-02-21 03:23:15,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:15,376 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times [2022-02-21 03:23:15,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:15,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922954381] [2022-02-21 03:23:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:15,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:15,399 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:15,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:23:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:23:15,437 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 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:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:15,510 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:23:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:23:15,511 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:15,534 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:15,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:15,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2022-02-21 03:23:15,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:15,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:15,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:15,538 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:23:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 03:23:15,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:15,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:15,540 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:15,540 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:15,541 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:23:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:15,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:15,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 26 transitions. [2022-02-21 03:23:15,542 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 26 transitions. [2022-02-21 03:23:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:15,543 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:23:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:15,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:15,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:15,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-21 03:23:15,545 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:23:15,545 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:23:15,545 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:23:15,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:23:15,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:15,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:15,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:15,547 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-02-21 03:23:15,547 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:15,547 INFO L791 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 339#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 342#L13-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; 343#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 344#L13-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; 340#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 341#L13-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; 360#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 359#L13-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; 358#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 357#L13-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; 356#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 355#L13-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; 354#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 353#L13-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; 352#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 351#L13-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; 350#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 349#L13-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; 348#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 347#L13-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; 346#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 345#L13-3 assume !(main_~i~0#1 < 1048); 336#L17-2 [2022-02-21 03:23:15,548 INFO L793 eck$LassoCheckResult]: Loop: 336#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 337#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 336#L17-2 [2022-02-21 03:23:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-02-21 03:23:15,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:15,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821071092] [2022-02-21 03:23:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {414#true} is VALID [2022-02-21 03:23:15,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {416#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#(= |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; {416#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:15,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {416#(= |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; {417#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= |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; {417#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:15,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#(<= |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; {418#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= |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; {418#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:15,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= |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; {419#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= |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; {419#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:15,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= |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; {420#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:15,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= |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; {420#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:15,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= |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; {421#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:15,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= |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; {421#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:15,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= |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; {422#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:15,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= |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; {422#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:15,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#(<= |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; {423#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:15,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#(<= |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; {423#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:15,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#(<= |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; {424#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:15,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#(<= |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; {424#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:15,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {424#(<= |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; {425#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:15,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {425#(<= |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; {425#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:15,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {425#(<= |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; {426#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:15,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {415#false} is VALID [2022-02-21 03:23:15,714 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:15,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:15,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821071092] [2022-02-21 03:23:15,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821071092] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:15,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049335701] [2022-02-21 03:23:15,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:23:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:15,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:23:15,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:23:15,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:15,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:16,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {414#true} is VALID [2022-02-21 03:23:16,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {433#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:16,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#(<= |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; {433#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:16,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {433#(<= |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; {417#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:16,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= |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; {417#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:16,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#(<= |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; {418#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:16,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= |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; {418#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:16,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= |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; {419#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:16,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= |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; {419#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:16,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= |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; {420#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:16,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= |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; {420#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:16,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= |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; {421#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:16,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= |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; {421#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:16,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= |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; {422#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:16,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= |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; {422#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:16,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#(<= |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; {423#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:16,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#(<= |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; {423#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:16,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#(<= |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; {424#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:16,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#(<= |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; {424#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:16,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {424#(<= |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; {425#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:16,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {425#(<= |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; {425#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:16,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {425#(<= |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; {426#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:16,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 1048); {415#false} is VALID [2022-02-21 03:23:16,068 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:16,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:16,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {497#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {415#false} is VALID [2022-02-21 03:23:16,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {501#(< |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; {497#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:16,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {501#(< |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; {501#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:16,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#(< |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; {501#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:16,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#(< |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; {508#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:16,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {515#(< |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; {508#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:16,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {515#(< |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; {515#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:16,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {522#(< |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; {515#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:16,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(< |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; {522#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:16,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(< |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; {522#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:16,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {529#(< |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; {529#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:16,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#(< |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; {529#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:16,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(< |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; {536#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:16,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(< |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; {536#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:16,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(< |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; {543#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:16,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(< |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; {543#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:16,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(< |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; {550#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:16,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#(< |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; {550#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:16,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {557#(< |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; {557#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:16,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {564#(< |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; {557#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:16,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#(< |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; {564#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:16,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {564#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:16,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {414#true} is VALID [2022-02-21 03:23:16,460 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:16,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049335701] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:16,460 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:16,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-02-21 03:23:16,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583559637] [2022-02-21 03:23:16,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:16,461 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times [2022-02-21 03:23:16,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902585993] [2022-02-21 03:23:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,495 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:16,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:23:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:23:16,539 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 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:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:16,668 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-02-21 03:23:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:23:16,669 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:16,712 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:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:16,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 50 transitions. [2022-02-21 03:23:16,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:16,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:16,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:16,717 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-02-21 03:23:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-02-21 03:23:16,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:16,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 50 transitions. Second operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16,720 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 50 transitions. Second operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16,721 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:16,722 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-02-21 03:23:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 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 49 states and 50 transitions. [2022-02-21 03:23:16,724 INFO L87 Difference]: Start difference. First operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 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 49 states and 50 transitions. [2022-02-21 03:23:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:16,725 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-02-21 03:23:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:16,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-02-21 03:23:16,728 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-02-21 03:23:16,728 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-02-21 03:23:16,728 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:23:16,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 50 transitions. [2022-02-21 03:23:16,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:16,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,731 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1] [2022-02-21 03:23:16,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:16,731 INFO L791 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 625#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 628#L13-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; 629#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 630#L13-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; 626#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 627#L13-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; 670#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 669#L13-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; 668#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 667#L13-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; 666#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 665#L13-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; 664#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 663#L13-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; 662#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 661#L13-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; 660#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 659#L13-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; 658#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 657#L13-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; 656#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 655#L13-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; 654#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 653#L13-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; 652#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 651#L13-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; 650#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 649#L13-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; 648#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 647#L13-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; 646#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 645#L13-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; 644#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 643#L13-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; 642#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 641#L13-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; 640#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 639#L13-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; 638#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 637#L13-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; 636#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 635#L13-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; 634#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 633#L13-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; 632#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 631#L13-3 assume !(main_~i~0#1 < 1048); 622#L17-2 [2022-02-21 03:23:16,731 INFO L793 eck$LassoCheckResult]: Loop: 622#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 623#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 622#L17-2 [2022-02-21 03:23:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash -111832455, now seen corresponding path program 4 times [2022-02-21 03:23:16,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873792800] [2022-02-21 03:23:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:17,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {772#true} is VALID [2022-02-21 03:23:17,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {774#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:17,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#(= |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; {774#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:17,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {774#(= |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; {775#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:17,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {775#(<= |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; {775#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:17,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#(<= |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; {776#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:17,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(<= |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; {776#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:17,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(<= |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; {777#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:17,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(<= |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; {777#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:17,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(<= |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; {778#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:17,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(<= |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; {778#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:17,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= |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; {779#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#(<= |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; {779#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:17,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#(<= |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; {780#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:17,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {780#(<= |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; {780#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:17,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#(<= |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; {781#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:17,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#(<= |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; {781#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:17,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {781#(<= |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; {782#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:17,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= |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; {782#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:17,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(<= |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; {783#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:17,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#(<= |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; {783#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:17,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {783#(<= |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; {784#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:17,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#(<= |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; {784#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:17,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#(<= |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; {785#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:17,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {785#(<= |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; {785#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:17,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {785#(<= |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; {786#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:17,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {786#(<= |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; {786#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:17,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {786#(<= |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; {787#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:17,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {787#(<= |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; {787#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:17,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {787#(<= |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; {788#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:17,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {788#(<= |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; {788#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:17,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {788#(<= |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; {789#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:17,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {789#(<= |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; {789#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:17,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {789#(<= |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; {790#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:17,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {790#(<= |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; {790#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:17,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {790#(<= |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; {791#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:17,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {791#(<= |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; {791#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:17,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {791#(<= |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; {792#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:17,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {792#(<= |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; {792#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:17,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {792#(<= |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; {793#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:17,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {793#(<= |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; {793#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:17,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {793#(<= |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; {794#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:17,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {794#(<= |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; {794#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:17,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {794#(<= |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; {795#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:17,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {795#(<= |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; {795#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:17,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {795#(<= |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; {796#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:17,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {796#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1048); {773#false} is VALID [2022-02-21 03:23:17,218 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:17,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:17,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873792800] [2022-02-21 03:23:17,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873792800] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:17,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985017803] [2022-02-21 03:23:17,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:23:17,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:17,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:17,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:17,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:23:17,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:23:17,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:17,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:23:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:17,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:17,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {772#true} is VALID [2022-02-21 03:23:17,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:17,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {803#(<= |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; {803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:17,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {803#(<= |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; {775#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:17,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {775#(<= |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; {775#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:17,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#(<= |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; {776#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:17,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(<= |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; {776#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:17,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(<= |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; {777#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:17,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(<= |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; {777#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:17,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(<= |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; {778#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:17,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(<= |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; {778#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:17,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= |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; {779#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:17,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#(<= |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; {779#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:17,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#(<= |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; {780#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:17,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {780#(<= |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; {780#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:17,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#(<= |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; {781#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:17,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#(<= |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; {781#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:17,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {781#(<= |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; {782#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:17,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= |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; {782#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:17,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {782#(<= |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; {783#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:17,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#(<= |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; {783#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:17,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {783#(<= |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; {784#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:17,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#(<= |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; {784#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:17,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#(<= |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; {785#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:17,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {785#(<= |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; {785#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:17,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {785#(<= |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; {786#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:17,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {786#(<= |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; {786#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:17,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {786#(<= |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; {787#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:17,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {787#(<= |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; {787#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:17,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {787#(<= |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; {788#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:17,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {788#(<= |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; {788#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:17,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {788#(<= |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; {789#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:17,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {789#(<= |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; {789#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:17,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {789#(<= |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; {790#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:17,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {790#(<= |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; {790#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:17,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {790#(<= |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; {791#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:17,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {791#(<= |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; {791#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:17,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {791#(<= |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; {792#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:17,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {792#(<= |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; {792#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:17,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {792#(<= |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; {793#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:17,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {793#(<= |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; {793#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:17,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {793#(<= |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; {794#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:17,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {794#(<= |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; {794#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:17,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {794#(<= |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; {795#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:17,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {795#(<= |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; {795#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:17,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {795#(<= |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; {796#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:17,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {796#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 1048); {773#false} is VALID [2022-02-21 03:23:17,755 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:17,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:18,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {939#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {773#false} is VALID [2022-02-21 03:23:18,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {943#(< |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; {939#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:18,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {943#(< |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; {943#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:18,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {950#(< |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; {943#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:18,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {950#(< |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; {950#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:18,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {957#(< |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; {950#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:18,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {957#(< |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; {957#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:18,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {964#(< |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; {957#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:18,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {964#(< |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; {964#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:18,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {971#(< |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; {964#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:18,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {971#(< |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; {971#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:18,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {978#(< |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; {971#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:18,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {978#(< |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; {978#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:18,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {985#(< |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; {978#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:18,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {985#(< |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; {985#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:18,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {992#(< |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; {985#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:18,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {992#(< |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; {992#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:18,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#(< |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; {992#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:18,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#(< |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; {999#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:18,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {1006#(< |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; {999#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:18,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {1006#(< |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; {1006#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:18,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {1013#(< |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; {1006#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:18,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1013#(< |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; {1013#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:18,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {1020#(< |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; {1013#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:18,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {1020#(< |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; {1020#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:18,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {1027#(< |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; {1020#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:18,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#(< |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; {1027#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:18,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {1034#(< |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; {1027#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:18,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {1034#(< |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; {1034#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:18,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1041#(< |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; {1034#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:18,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1041#(< |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; {1041#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:18,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#(< |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; {1041#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:18,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(< |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; {1048#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:18,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#(< |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; {1048#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:18,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#(< |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; {1055#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:18,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#(< |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; {1055#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:18,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(< |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; {1062#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:18,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(< |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; {1062#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:18,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(< |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; {1069#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:18,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(< |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; {1069#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:18,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#(< |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; {1076#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:18,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#(< |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; {1076#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:18,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {1083#(< |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; {1083#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:18,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {1090#(< |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; {1083#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:18,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#(< |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; {1090#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:18,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1090#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:18,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {772#true} is VALID [2022-02-21 03:23:18,854 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:18,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985017803] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:18,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:18,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-02-21 03:23:18,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658555968] [2022-02-21 03:23:18,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:18,855 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times [2022-02-21 03:23:18,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:18,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146243643] [2022-02-21 03:23:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:18,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:18,867 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:18,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-21 03:23:18,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-21 03:23:18,912 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. cyclomatic complexity: 3 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:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:19,207 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-02-21 03:23:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:23:19,208 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:19,311 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:19,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:19,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 98 transitions. [2022-02-21 03:23:19,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:19,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:19,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:19,319 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-02-21 03:23:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-21 03:23:19,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:19,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 98 transitions. Second operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 98 transitions. Second operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:19,325 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:19,328 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-02-21 03:23:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:19,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:19,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 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 97 states and 98 transitions. [2022-02-21 03:23:19,329 INFO L87 Difference]: Start difference. First operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 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 97 states and 98 transitions. [2022-02-21 03:23:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:19,332 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-02-21 03:23:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:19,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-02-21 03:23:19,336 INFO L704 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-02-21 03:23:19,336 INFO L587 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-02-21 03:23:19,336 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:23:19,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 98 transitions. [2022-02-21 03:23:19,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:19,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:19,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:19,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1] [2022-02-21 03:23:19,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:19,340 INFO L791 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1199#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 1202#L13-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; 1203#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1204#L13-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; 1200#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1201#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1291#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1289#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1287#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1285#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1283#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1281#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1279#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1277#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1275#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1273#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1271#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1269#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1267#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1265#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1263#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1261#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1259#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1257#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1255#L13-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; 1254#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1253#L13-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; 1252#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1251#L13-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; 1250#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1249#L13-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; 1248#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1247#L13-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; 1246#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1245#L13-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; 1244#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1243#L13-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; 1242#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1241#L13-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; 1240#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1239#L13-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; 1238#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1237#L13-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; 1236#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1235#L13-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; 1234#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1233#L13-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; 1232#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1231#L13-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; 1230#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1229#L13-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; 1228#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1227#L13-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; 1226#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1225#L13-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; 1224#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1223#L13-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; 1222#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1221#L13-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; 1220#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1219#L13-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; 1218#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1217#L13-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; 1216#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1215#L13-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; 1214#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1213#L13-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; 1212#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1211#L13-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; 1210#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1209#L13-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; 1208#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1207#L13-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; 1206#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1205#L13-3 assume !(main_~i~0#1 < 1048); 1196#L17-2 [2022-02-21 03:23:19,341 INFO L793 eck$LassoCheckResult]: Loop: 1196#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 1197#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 1196#L17-2 [2022-02-21 03:23:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1497227703, now seen corresponding path program 5 times [2022-02-21 03:23:19,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:19,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478522] [2022-02-21 03:23:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:20,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1490#true} is VALID [2022-02-21 03:23:20,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1492#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:20,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#(= |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; {1492#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:20,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {1492#(= |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; {1493#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:20,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {1493#(<= |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; {1493#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:20,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#(<= |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; {1494#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:20,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {1494#(<= |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; {1494#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:20,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {1494#(<= |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; {1495#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:20,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= |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; {1495#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:20,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= |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; {1496#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:20,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {1496#(<= |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; {1496#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:20,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {1496#(<= |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; {1497#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:20,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1497#(<= |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; {1497#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:20,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1497#(<= |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; {1498#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:20,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(<= |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; {1498#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:20,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(<= |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; {1499#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:20,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#(<= |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; {1499#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:20,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#(<= |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; {1500#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:20,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {1500#(<= |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; {1500#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:20,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {1500#(<= |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; {1501#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:20,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(<= |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; {1501#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:20,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#(<= |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; {1502#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:20,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {1502#(<= |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; {1502#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:20,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#(<= |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; {1503#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:20,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {1503#(<= |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; {1503#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:20,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#(<= |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; {1504#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:20,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {1504#(<= |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; {1504#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:20,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {1504#(<= |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; {1505#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:20,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#(<= |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; {1505#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:20,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {1505#(<= |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; {1506#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:20,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {1506#(<= |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; {1506#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:20,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {1506#(<= |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; {1507#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:20,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {1507#(<= |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; {1507#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:20,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {1507#(<= |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; {1508#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:20,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {1508#(<= |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; {1508#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:20,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {1508#(<= |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; {1509#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:20,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {1509#(<= |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; {1509#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:20,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {1509#(<= |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; {1510#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:20,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {1510#(<= |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; {1510#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:20,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {1510#(<= |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; {1511#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:20,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {1511#(<= |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; {1511#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:20,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {1511#(<= |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; {1512#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:20,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {1512#(<= |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; {1512#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:20,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {1512#(<= |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; {1513#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:20,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {1513#(<= |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; {1513#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:20,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {1513#(<= |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; {1514#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:20,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {1514#(<= |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; {1514#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:20,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {1514#(<= |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; {1515#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:20,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#(<= |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; {1515#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:20,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {1515#(<= |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; {1516#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:20,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {1516#(<= |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; {1516#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:20,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {1516#(<= |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; {1517#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:20,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {1517#(<= |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; {1517#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:20,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {1517#(<= |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; {1518#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:20,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {1518#(<= |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; {1518#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:20,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {1518#(<= |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; {1519#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:20,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {1519#(<= |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; {1519#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:20,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {1519#(<= |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; {1520#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:20,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {1520#(<= |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; {1520#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:20,494 INFO L290 TraceCheckUtils]: 59: Hoare triple {1520#(<= |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; {1521#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:20,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {1521#(<= |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; {1521#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:20,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {1521#(<= |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; {1522#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:20,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {1522#(<= |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; {1522#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:20,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {1522#(<= |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; {1523#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:20,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {1523#(<= |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; {1523#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:20,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {1523#(<= |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; {1524#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:20,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {1524#(<= |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; {1524#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:20,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {1524#(<= |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; {1525#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:20,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {1525#(<= |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; {1525#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:20,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {1525#(<= |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; {1526#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:20,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {1526#(<= |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; {1526#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:20,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {1526#(<= |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; {1527#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:20,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {1527#(<= |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; {1527#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:20,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {1527#(<= |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; {1528#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:20,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {1528#(<= |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; {1528#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:20,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {1528#(<= |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; {1529#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:20,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {1529#(<= |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; {1529#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:20,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {1529#(<= |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; {1530#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:20,505 INFO L290 TraceCheckUtils]: 78: Hoare triple {1530#(<= |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; {1530#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:20,505 INFO L290 TraceCheckUtils]: 79: Hoare triple {1530#(<= |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; {1531#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:20,505 INFO L290 TraceCheckUtils]: 80: Hoare triple {1531#(<= |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; {1531#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:20,506 INFO L290 TraceCheckUtils]: 81: Hoare triple {1531#(<= |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; {1532#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:20,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {1532#(<= |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; {1532#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:20,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {1532#(<= |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; {1533#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:20,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {1533#(<= |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; {1533#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:20,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {1533#(<= |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; {1534#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:20,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {1534#(<= |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; {1534#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:20,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {1534#(<= |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; {1535#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:20,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {1535#(<= |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; {1535#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:20,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {1535#(<= |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; {1536#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:20,509 INFO L290 TraceCheckUtils]: 90: Hoare triple {1536#(<= |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; {1536#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:20,509 INFO L290 TraceCheckUtils]: 91: Hoare triple {1536#(<= |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; {1537#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:20,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {1537#(<= |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; {1537#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:20,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {1537#(<= |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; {1538#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:20,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {1538#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 1048); {1491#false} is VALID [2022-02-21 03:23:20,512 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:20,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:20,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478522] [2022-02-21 03:23:20,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478522] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:20,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790599836] [2022-02-21 03:23:20,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:23:20,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:20,515 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:20,517 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:31,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-21 03:23:31,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:31,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:23:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:31,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:32,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1490#true} is VALID [2022-02-21 03:23:32,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {1545#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:32,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#(<= |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; {1545#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:32,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {1545#(<= |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; {1493#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:32,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {1493#(<= |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; {1493#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:32,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#(<= |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; {1494#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:32,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {1494#(<= |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; {1494#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:32,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1494#(<= |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; {1495#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:32,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= |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; {1495#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:32,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= |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; {1496#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:32,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1496#(<= |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; {1496#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:32,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {1496#(<= |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; {1497#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:32,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {1497#(<= |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; {1497#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:32,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1497#(<= |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; {1498#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:32,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(<= |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; {1498#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:32,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(<= |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; {1499#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:32,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#(<= |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; {1499#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:32,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#(<= |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; {1500#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:32,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1500#(<= |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; {1500#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:32,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1500#(<= |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; {1501#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:32,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(<= |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; {1501#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:32,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#(<= |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; {1502#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:32,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {1502#(<= |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; {1502#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:32,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#(<= |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; {1503#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:32,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1503#(<= |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; {1503#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:32,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#(<= |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; {1504#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:32,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {1504#(<= |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; {1504#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:32,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {1504#(<= |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; {1505#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:32,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#(<= |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; {1505#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:32,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {1505#(<= |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; {1506#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:32,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {1506#(<= |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; {1506#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:32,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {1506#(<= |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; {1507#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:32,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {1507#(<= |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; {1507#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:32,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {1507#(<= |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; {1508#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:32,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {1508#(<= |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; {1508#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:32,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {1508#(<= |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; {1509#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:32,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {1509#(<= |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; {1509#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:32,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {1509#(<= |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; {1510#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:32,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {1510#(<= |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; {1510#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:32,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {1510#(<= |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; {1511#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:32,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {1511#(<= |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; {1511#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:32,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {1511#(<= |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; {1512#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:32,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {1512#(<= |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; {1512#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:32,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {1512#(<= |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; {1513#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:32,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {1513#(<= |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; {1513#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:32,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {1513#(<= |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; {1514#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:32,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {1514#(<= |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; {1514#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:32,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {1514#(<= |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; {1515#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:32,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#(<= |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; {1515#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:32,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {1515#(<= |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; {1516#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:32,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {1516#(<= |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; {1516#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:32,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {1516#(<= |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; {1517#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:32,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {1517#(<= |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; {1517#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:32,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {1517#(<= |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; {1518#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:32,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {1518#(<= |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; {1518#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:32,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {1518#(<= |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; {1519#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:32,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {1519#(<= |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; {1519#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:32,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {1519#(<= |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; {1520#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:32,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {1520#(<= |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; {1520#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:32,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {1520#(<= |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; {1521#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:32,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {1521#(<= |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; {1521#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:32,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {1521#(<= |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; {1522#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:32,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {1522#(<= |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; {1522#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:32,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {1522#(<= |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; {1523#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:32,717 INFO L290 TraceCheckUtils]: 64: Hoare triple {1523#(<= |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; {1523#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:32,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {1523#(<= |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; {1524#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:32,717 INFO L290 TraceCheckUtils]: 66: Hoare triple {1524#(<= |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; {1524#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:32,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {1524#(<= |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; {1525#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:32,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {1525#(<= |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; {1525#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:32,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {1525#(<= |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; {1526#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:32,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {1526#(<= |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; {1526#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:32,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {1526#(<= |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; {1527#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:32,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {1527#(<= |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; {1527#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:32,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {1527#(<= |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; {1528#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:32,720 INFO L290 TraceCheckUtils]: 74: Hoare triple {1528#(<= |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; {1528#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:32,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {1528#(<= |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; {1529#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:32,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {1529#(<= |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; {1529#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:32,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {1529#(<= |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; {1530#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:32,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {1530#(<= |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; {1530#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:32,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {1530#(<= |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; {1531#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:32,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {1531#(<= |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; {1531#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:32,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {1531#(<= |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; {1532#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:32,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {1532#(<= |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; {1532#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:32,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {1532#(<= |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; {1533#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:32,725 INFO L290 TraceCheckUtils]: 84: Hoare triple {1533#(<= |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; {1533#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:32,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {1533#(<= |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; {1534#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:32,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {1534#(<= |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; {1534#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:32,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {1534#(<= |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; {1535#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:32,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {1535#(<= |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; {1535#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:32,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {1535#(<= |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; {1536#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:32,728 INFO L290 TraceCheckUtils]: 90: Hoare triple {1536#(<= |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; {1536#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:32,728 INFO L290 TraceCheckUtils]: 91: Hoare triple {1536#(<= |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; {1537#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:32,729 INFO L290 TraceCheckUtils]: 92: Hoare triple {1537#(<= |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; {1537#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:32,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {1537#(<= |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; {1538#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:32,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {1538#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 1048); {1491#false} is VALID [2022-02-21 03:23:32,731 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,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:35,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {1825#(< |ULTIMATE.start_main_~i~0#1| 1048)} assume !(main_~i~0#1 < 1048); {1491#false} is VALID [2022-02-21 03:23:35,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {1829#(< |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; {1825#(< |ULTIMATE.start_main_~i~0#1| 1048)} is VALID [2022-02-21 03:23:35,681 INFO L290 TraceCheckUtils]: 92: Hoare triple {1829#(< |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; {1829#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:35,681 INFO L290 TraceCheckUtils]: 91: Hoare triple {1836#(< |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; {1829#(< |ULTIMATE.start_main_~i~0#1| 1047)} is VALID [2022-02-21 03:23:35,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {1836#(< |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; {1836#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:35,682 INFO L290 TraceCheckUtils]: 89: Hoare triple {1843#(< |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; {1836#(< |ULTIMATE.start_main_~i~0#1| 1046)} is VALID [2022-02-21 03:23:35,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {1843#(< |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; {1843#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:35,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {1850#(< |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; {1843#(< |ULTIMATE.start_main_~i~0#1| 1045)} is VALID [2022-02-21 03:23:35,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {1850#(< |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; {1850#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:35,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {1857#(< |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; {1850#(< |ULTIMATE.start_main_~i~0#1| 1044)} is VALID [2022-02-21 03:23:35,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {1857#(< |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; {1857#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:35,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {1864#(< |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; {1857#(< |ULTIMATE.start_main_~i~0#1| 1043)} is VALID [2022-02-21 03:23:35,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {1864#(< |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; {1864#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:35,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {1871#(< |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; {1864#(< |ULTIMATE.start_main_~i~0#1| 1042)} is VALID [2022-02-21 03:23:35,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {1871#(< |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; {1871#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:35,685 INFO L290 TraceCheckUtils]: 79: Hoare triple {1878#(< |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; {1871#(< |ULTIMATE.start_main_~i~0#1| 1041)} is VALID [2022-02-21 03:23:35,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {1878#(< |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; {1878#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:35,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {1885#(< |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; {1878#(< |ULTIMATE.start_main_~i~0#1| 1040)} is VALID [2022-02-21 03:23:35,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {1885#(< |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; {1885#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:35,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {1892#(< |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; {1885#(< |ULTIMATE.start_main_~i~0#1| 1039)} is VALID [2022-02-21 03:23:35,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {1892#(< |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; {1892#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:35,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {1899#(< |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; {1892#(< |ULTIMATE.start_main_~i~0#1| 1038)} is VALID [2022-02-21 03:23:35,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {1899#(< |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; {1899#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:35,688 INFO L290 TraceCheckUtils]: 71: Hoare triple {1906#(< |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; {1899#(< |ULTIMATE.start_main_~i~0#1| 1037)} is VALID [2022-02-21 03:23:35,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {1906#(< |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; {1906#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:35,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {1913#(< |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; {1906#(< |ULTIMATE.start_main_~i~0#1| 1036)} is VALID [2022-02-21 03:23:35,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {1913#(< |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; {1913#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:35,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {1920#(< |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; {1913#(< |ULTIMATE.start_main_~i~0#1| 1035)} is VALID [2022-02-21 03:23:35,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {1920#(< |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; {1920#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:35,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {1927#(< |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; {1920#(< |ULTIMATE.start_main_~i~0#1| 1034)} is VALID [2022-02-21 03:23:35,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {1927#(< |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; {1927#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:35,691 INFO L290 TraceCheckUtils]: 63: Hoare triple {1934#(< |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; {1927#(< |ULTIMATE.start_main_~i~0#1| 1033)} is VALID [2022-02-21 03:23:35,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {1934#(< |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; {1934#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:35,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {1941#(< |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; {1934#(< |ULTIMATE.start_main_~i~0#1| 1032)} is VALID [2022-02-21 03:23:35,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {1941#(< |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; {1941#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:35,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {1948#(< |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; {1941#(< |ULTIMATE.start_main_~i~0#1| 1031)} is VALID [2022-02-21 03:23:35,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {1948#(< |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; {1948#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:35,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {1955#(< |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; {1948#(< |ULTIMATE.start_main_~i~0#1| 1030)} is VALID [2022-02-21 03:23:35,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {1955#(< |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; {1955#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:35,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {1962#(< |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; {1955#(< |ULTIMATE.start_main_~i~0#1| 1029)} is VALID [2022-02-21 03:23:35,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {1962#(< |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; {1962#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:35,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {1969#(< |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; {1962#(< |ULTIMATE.start_main_~i~0#1| 1028)} is VALID [2022-02-21 03:23:35,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {1969#(< |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; {1969#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:35,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {1976#(< |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; {1969#(< |ULTIMATE.start_main_~i~0#1| 1027)} is VALID [2022-02-21 03:23:35,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {1976#(< |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; {1976#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:35,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {1983#(< |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; {1976#(< |ULTIMATE.start_main_~i~0#1| 1026)} is VALID [2022-02-21 03:23:35,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {1983#(< |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; {1983#(< |ULTIMATE.start_main_~i~0#1| 1025)} is VALID [2022-02-21 03:23:35,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {1990#(< |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; {1983#(< |ULTIMATE.start_main_~i~0#1| 1025)} is VALID [2022-02-21 03:23:35,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {1990#(< |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; {1990#(< |ULTIMATE.start_main_~i~0#1| 1024)} is VALID [2022-02-21 03:23:35,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {1997#(< |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; {1990#(< |ULTIMATE.start_main_~i~0#1| 1024)} is VALID [2022-02-21 03:23:35,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {1997#(< |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; {1997#(< |ULTIMATE.start_main_~i~0#1| 1023)} is VALID [2022-02-21 03:23:35,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {2004#(< |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; {1997#(< |ULTIMATE.start_main_~i~0#1| 1023)} is VALID [2022-02-21 03:23:35,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {2004#(< |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; {2004#(< |ULTIMATE.start_main_~i~0#1| 1022)} is VALID [2022-02-21 03:23:35,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {2011#(< |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; {2004#(< |ULTIMATE.start_main_~i~0#1| 1022)} is VALID [2022-02-21 03:23:35,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {2011#(< |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; {2011#(< |ULTIMATE.start_main_~i~0#1| 1021)} is VALID [2022-02-21 03:23:35,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {2018#(< |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; {2011#(< |ULTIMATE.start_main_~i~0#1| 1021)} is VALID [2022-02-21 03:23:35,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {2018#(< |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; {2018#(< |ULTIMATE.start_main_~i~0#1| 1020)} is VALID [2022-02-21 03:23:35,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {2025#(< |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; {2018#(< |ULTIMATE.start_main_~i~0#1| 1020)} is VALID [2022-02-21 03:23:35,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {2025#(< |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; {2025#(< |ULTIMATE.start_main_~i~0#1| 1019)} is VALID [2022-02-21 03:23:35,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {2032#(< |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; {2025#(< |ULTIMATE.start_main_~i~0#1| 1019)} is VALID [2022-02-21 03:23:35,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {2032#(< |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; {2032#(< |ULTIMATE.start_main_~i~0#1| 1018)} is VALID [2022-02-21 03:23:35,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {2039#(< |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; {2032#(< |ULTIMATE.start_main_~i~0#1| 1018)} is VALID [2022-02-21 03:23:35,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {2039#(< |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; {2039#(< |ULTIMATE.start_main_~i~0#1| 1017)} is VALID [2022-02-21 03:23:35,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {2046#(< |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; {2039#(< |ULTIMATE.start_main_~i~0#1| 1017)} is VALID [2022-02-21 03:23:35,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {2046#(< |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; {2046#(< |ULTIMATE.start_main_~i~0#1| 1016)} is VALID [2022-02-21 03:23:35,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {2053#(< |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; {2046#(< |ULTIMATE.start_main_~i~0#1| 1016)} is VALID [2022-02-21 03:23:35,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {2053#(< |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; {2053#(< |ULTIMATE.start_main_~i~0#1| 1015)} is VALID [2022-02-21 03:23:35,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {2060#(< |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; {2053#(< |ULTIMATE.start_main_~i~0#1| 1015)} is VALID [2022-02-21 03:23:35,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {2060#(< |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; {2060#(< |ULTIMATE.start_main_~i~0#1| 1014)} is VALID [2022-02-21 03:23:35,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {2067#(< |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; {2060#(< |ULTIMATE.start_main_~i~0#1| 1014)} is VALID [2022-02-21 03:23:35,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {2067#(< |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; {2067#(< |ULTIMATE.start_main_~i~0#1| 1013)} is VALID [2022-02-21 03:23:35,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {2074#(< |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; {2067#(< |ULTIMATE.start_main_~i~0#1| 1013)} is VALID [2022-02-21 03:23:35,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {2074#(< |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; {2074#(< |ULTIMATE.start_main_~i~0#1| 1012)} is VALID [2022-02-21 03:23:35,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {2081#(< |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; {2074#(< |ULTIMATE.start_main_~i~0#1| 1012)} is VALID [2022-02-21 03:23:35,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {2081#(< |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; {2081#(< |ULTIMATE.start_main_~i~0#1| 1011)} is VALID [2022-02-21 03:23:35,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#(< |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; {2081#(< |ULTIMATE.start_main_~i~0#1| 1011)} is VALID [2022-02-21 03:23:35,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#(< |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; {2088#(< |ULTIMATE.start_main_~i~0#1| 1010)} is VALID [2022-02-21 03:23:35,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {2095#(< |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; {2088#(< |ULTIMATE.start_main_~i~0#1| 1010)} is VALID [2022-02-21 03:23:35,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {2095#(< |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; {2095#(< |ULTIMATE.start_main_~i~0#1| 1009)} is VALID [2022-02-21 03:23:35,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {2102#(< |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; {2095#(< |ULTIMATE.start_main_~i~0#1| 1009)} is VALID [2022-02-21 03:23:35,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(< |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; {2102#(< |ULTIMATE.start_main_~i~0#1| 1008)} is VALID [2022-02-21 03:23:35,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {2109#(< |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; {2102#(< |ULTIMATE.start_main_~i~0#1| 1008)} is VALID [2022-02-21 03:23:35,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#(< |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; {2109#(< |ULTIMATE.start_main_~i~0#1| 1007)} is VALID [2022-02-21 03:23:35,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {2116#(< |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; {2109#(< |ULTIMATE.start_main_~i~0#1| 1007)} is VALID [2022-02-21 03:23:35,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {2116#(< |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; {2116#(< |ULTIMATE.start_main_~i~0#1| 1006)} is VALID [2022-02-21 03:23:35,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2123#(< |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; {2116#(< |ULTIMATE.start_main_~i~0#1| 1006)} is VALID [2022-02-21 03:23:35,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {2123#(< |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; {2123#(< |ULTIMATE.start_main_~i~0#1| 1005)} is VALID [2022-02-21 03:23:35,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#(< |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; {2123#(< |ULTIMATE.start_main_~i~0#1| 1005)} is VALID [2022-02-21 03:23:35,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#(< |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; {2130#(< |ULTIMATE.start_main_~i~0#1| 1004)} is VALID [2022-02-21 03:23:35,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< |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; {2130#(< |ULTIMATE.start_main_~i~0#1| 1004)} is VALID [2022-02-21 03:23:35,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {2137#(< |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; {2137#(< |ULTIMATE.start_main_~i~0#1| 1003)} is VALID [2022-02-21 03:23:35,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {2144#(< |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; {2137#(< |ULTIMATE.start_main_~i~0#1| 1003)} is VALID [2022-02-21 03:23:35,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2144#(< |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; {2144#(< |ULTIMATE.start_main_~i~0#1| 1002)} is VALID [2022-02-21 03:23:35,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {2144#(< |ULTIMATE.start_main_~i~0#1| 1002)} is VALID [2022-02-21 03:23:35,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1490#true} is VALID [2022-02-21 03:23:35,715 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,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790599836] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:35,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:35,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-02-21 03:23:35,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782083723] [2022-02-21 03:23:35,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:35,716 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 6 times [2022-02-21 03:23:35,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:35,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157819468] [2022-02-21 03:23:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:35,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:35,726 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:35,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-21 03:23:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-21 03:23:35,772 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. cyclomatic complexity: 3 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:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:36,245 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2022-02-21 03:23:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:23:36,245 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,418 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,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:36,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 194 transitions. [2022-02-21 03:23:36,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:23:36,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:23:36,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:36,430 INFO L681 BuchiCegarLoop]: Abstraction has 193 states and 194 transitions. [2022-02-21 03:23:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-02-21 03:23:36,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:36,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states and 194 transitions. Second operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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,437 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states and 194 transitions. Second operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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,437 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:36,442 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2022-02-21 03:23:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:36,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:36,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 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 193 states and 194 transitions. [2022-02-21 03:23:36,444 INFO L87 Difference]: Start difference. First operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 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 193 states and 194 transitions. [2022-02-21 03:23:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:36,450 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2022-02-21 03:23:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:36,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:36,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:36,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2022-02-21 03:23:36,460 INFO L704 BuchiCegarLoop]: Abstraction has 193 states and 194 transitions. [2022-02-21 03:23:36,460 INFO L587 BuchiCegarLoop]: Abstraction has 193 states and 194 transitions. [2022-02-21 03:23:36,460 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:23:36,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 194 transitions. [2022-02-21 03:23:36,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:23:36,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:36,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:36,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1] [2022-02-21 03:23:36,477 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:36,477 INFO L791 eck$LassoCheckResult]: Stem: 2348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2349#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 2352#L13-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; 2353#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2354#L13-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; 2350#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2351#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2537#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2535#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2533#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2531#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2529#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2527#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2525#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2523#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2521#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2519#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2517#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2515#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2513#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2511#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2509#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2507#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2505#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2503#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2501#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2499#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2497#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2495#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2493#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2491#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2489#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2487#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2485#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2483#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2481#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2479#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2477#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2475#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2473#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2471#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2469#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2467#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2465#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2463#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2461#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2459#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2457#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2455#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2453#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2451#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2449#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2447#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2445#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2443#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2441#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2439#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2437#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2435#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2433#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2431#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2429#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2427#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2425#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2423#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2421#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2419#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2417#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2415#L13-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#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2413#L13-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; 2412#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2411#L13-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; 2410#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2409#L13-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; 2408#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2407#L13-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; 2406#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2405#L13-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; 2404#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2403#L13-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; 2402#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2401#L13-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; 2400#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2399#L13-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; 2398#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2397#L13-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; 2396#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2395#L13-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; 2394#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2393#L13-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; 2392#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2391#L13-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; 2390#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2389#L13-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; 2388#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2387#L13-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; 2386#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2385#L13-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; 2384#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2383#L13-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; 2382#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2381#L13-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; 2380#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2379#L13-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; 2378#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2377#L13-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; 2376#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2375#L13-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; 2374#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2373#L13-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; 2372#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2371#L13-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; 2370#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2369#L13-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; 2368#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2367#L13-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; 2366#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2365#L13-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; 2364#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2363#L13-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; 2362#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2361#L13-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; 2360#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2359#L13-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; 2358#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2357#L13-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; 2356#L13-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2355#L13-3 assume !(main_~i~0#1 < 1048); 2346#L17-2 [2022-02-21 03:23:36,478 INFO L793 eck$LassoCheckResult]: Loop: 2346#L17-2 call main_#t~mem2#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4); 2347#L17 assume !!(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1; 2346#L17-2 [2022-02-21 03:23:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2115802601, now seen corresponding path program 6 times [2022-02-21 03:23:36,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:36,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582974346] [2022-02-21 03:23:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:40,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {2928#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2928#true} is VALID [2022-02-21 03:23:40,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {2928#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~mem3#1, main_#t~mem2#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; {2930#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:40,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {2930#(= |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; {2930#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:23:40,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {2930#(= |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; {2931#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:40,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {2931#(<= |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; {2931#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:23:40,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#(<= |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; {2932#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:40,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {2932#(<= |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; {2932#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:23:40,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2932#(<= |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; {2933#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:40,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2933#(<= |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; {2933#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:23:40,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {2933#(<= |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; {2934#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:40,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {2934#(<= |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; {2934#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:23:40,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {2934#(<= |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; {2935#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:40,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {2935#(<= |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; {2935#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:23:40,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {2935#(<= |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; {2936#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:40,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {2936#(<= |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; {2936#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:23:40,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {2936#(<= |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; {2937#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:40,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {2937#(<= |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; {2937#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:23:40,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#(<= |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; {2938#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:40,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#(<= |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; {2938#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:23:40,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#(<= |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; {2939#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:40,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {2939#(<= |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; {2939#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:23:40,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {2939#(<= |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; {2940#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:40,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {2940#(<= |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; {2940#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:23:40,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {2940#(<= |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; {2941#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:40,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {2941#(<= |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; {2941#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:23:40,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {2941#(<= |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; {2942#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:40,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {2942#(<= |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; {2942#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:23:40,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#(<= |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; {2943#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:40,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {2943#(<= |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; {2943#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:23:40,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {2943#(<= |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; {2944#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:40,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#(<= |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; {2944#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:23:40,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#(<= |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; {2945#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:40,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {2945#(<= |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; {2945#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:23:40,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {2945#(<= |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; {2946#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:40,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {2946#(<= |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; {2946#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:23:40,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {2946#(<= |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; {2947#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:40,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {2947#(<= |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; {2947#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:23:40,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {2947#(<= |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; {2948#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:40,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {2948#(<= |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; {2948#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:23:40,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {2948#(<= |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; {2949#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:40,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {2949#(<= |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; {2949#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:23:40,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {2949#(<= |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; {2950#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:40,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {2950#(<= |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; {2950#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:23:40,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {2950#(<= |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; {2951#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:40,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#(<= |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; {2951#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:23:40,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#(<= |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; {2952#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:40,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {2952#(<= |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; {2952#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:23:40,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {2952#(<= |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; {2953#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:40,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {2953#(<= |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; {2953#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:23:40,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {2953#(<= |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; {2954#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:40,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {2954#(<= |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; {2954#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:23:40,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {2954#(<= |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; {2955#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:40,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {2955#(<= |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; {2955#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:23:40,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {2955#(<= |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; {2956#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:40,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {2956#(<= |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; {2956#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:23:40,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {2956#(<= |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; {2957#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:40,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {2957#(<= |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; {2957#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:23:40,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {2957#(<= |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; {2958#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:40,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {2958#(<= |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; {2958#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:23:40,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {2958#(<= |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; {2959#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:40,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {2959#(<= |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; {2959#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:23:40,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {2959#(<= |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; {2960#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:40,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {2960#(<= |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; {2960#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:23:40,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {2960#(<= |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; {2961#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:40,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {2961#(<= |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; {2961#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:23:40,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {2961#(<= |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; {2962#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:40,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {2962#(<= |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; {2962#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:23:40,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {2962#(<= |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; {2963#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:40,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {2963#(<= |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; {2963#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:23:40,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {2963#(<= |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; {2964#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:40,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {2964#(<= |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; {2964#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:23:40,155 INFO L290 TraceCheckUtils]: 71: Hoare triple {2964#(<= |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; {2965#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:40,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {2965#(<= |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; {2965#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:23:40,155 INFO L290 TraceCheckUtils]: 73: Hoare triple {2965#(<= |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; {2966#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:40,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {2966#(<= |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; {2966#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:23:40,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {2966#(<= |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; {2967#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:40,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {2967#(<= |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; {2967#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:23:40,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {2967#(<= |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; {2968#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:40,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {2968#(<= |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; {2968#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:23:40,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {2968#(<= |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; {2969#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:40,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {2969#(<= |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; {2969#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:23:40,159 INFO L290 TraceCheckUtils]: 81: Hoare triple {2969#(<= |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; {2970#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:40,159 INFO L290 TraceCheckUtils]: 82: Hoare triple {2970#(<= |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; {2970#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:23:40,159 INFO L290 TraceCheckUtils]: 83: Hoare triple {2970#(<= |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; {2971#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:40,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {2971#(<= |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; {2971#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:23:40,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {2971#(<= |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; {2972#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:40,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {2972#(<= |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; {2972#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:23:40,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {2972#(<= |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; {2973#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:40,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {2973#(<= |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; {2973#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:23:40,162 INFO L290 TraceCheckUtils]: 89: Hoare triple {2973#(<= |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; {2974#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:40,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {2974#(<= |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; {2974#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:23:40,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {2974#(<= |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; {2975#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:40,163 INFO L290 TraceCheckUtils]: 92: Hoare triple {2975#(<= |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; {2975#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:23:40,163 INFO L290 TraceCheckUtils]: 93: Hoare triple {2975#(<= |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; {2976#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:40,163 INFO L290 TraceCheckUtils]: 94: Hoare triple {2976#(<= |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; {2976#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:23:40,164 INFO L290 TraceCheckUtils]: 95: Hoare triple {2976#(<= |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; {2977#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:23:40,164 INFO L290 TraceCheckUtils]: 96: Hoare triple {2977#(<= |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; {2977#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:23:40,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {2977#(<= |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; {2978#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:23:40,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {2978#(<= |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; {2978#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:23:40,166 INFO L290 TraceCheckUtils]: 99: Hoare triple {2978#(<= |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; {2979#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:23:40,166 INFO L290 TraceCheckUtils]: 100: Hoare triple {2979#(<= |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; {2979#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:23:40,166 INFO L290 TraceCheckUtils]: 101: Hoare triple {2979#(<= |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; {2980#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:23:40,167 INFO L290 TraceCheckUtils]: 102: Hoare triple {2980#(<= |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; {2980#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:23:40,167 INFO L290 TraceCheckUtils]: 103: Hoare triple {2980#(<= |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; {2981#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:23:40,168 INFO L290 TraceCheckUtils]: 104: Hoare triple {2981#(<= |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; {2981#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:23:40,169 INFO L290 TraceCheckUtils]: 105: Hoare triple {2981#(<= |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; {2982#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:23:40,169 INFO L290 TraceCheckUtils]: 106: Hoare triple {2982#(<= |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; {2982#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:23:40,169 INFO L290 TraceCheckUtils]: 107: Hoare triple {2982#(<= |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; {2983#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:23:40,170 INFO L290 TraceCheckUtils]: 108: Hoare triple {2983#(<= |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; {2983#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:23:40,170 INFO L290 TraceCheckUtils]: 109: Hoare triple {2983#(<= |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; {2984#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:23:40,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {2984#(<= |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; {2984#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:23:40,171 INFO L290 TraceCheckUtils]: 111: Hoare triple {2984#(<= |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; {2985#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:23:40,171 INFO L290 TraceCheckUtils]: 112: Hoare triple {2985#(<= |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; {2985#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:23:40,171 INFO L290 TraceCheckUtils]: 113: Hoare triple {2985#(<= |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; {2986#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:23:40,172 INFO L290 TraceCheckUtils]: 114: Hoare triple {2986#(<= |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; {2986#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:23:40,172 INFO L290 TraceCheckUtils]: 115: Hoare triple {2986#(<= |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; {2987#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:23:40,172 INFO L290 TraceCheckUtils]: 116: Hoare triple {2987#(<= |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; {2987#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:23:40,173 INFO L290 TraceCheckUtils]: 117: Hoare triple {2987#(<= |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; {2988#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:23:40,173 INFO L290 TraceCheckUtils]: 118: Hoare triple {2988#(<= |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; {2988#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:23:40,174 INFO L290 TraceCheckUtils]: 119: Hoare triple {2988#(<= |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; {2989#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:23:40,174 INFO L290 TraceCheckUtils]: 120: Hoare triple {2989#(<= |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; {2989#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:23:40,175 INFO L290 TraceCheckUtils]: 121: Hoare triple {2989#(<= |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; {2990#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:23:40,175 INFO L290 TraceCheckUtils]: 122: Hoare triple {2990#(<= |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; {2990#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:23:40,175 INFO L290 TraceCheckUtils]: 123: Hoare triple {2990#(<= |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; {2991#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:23:40,176 INFO L290 TraceCheckUtils]: 124: Hoare triple {2991#(<= |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; {2991#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:23:40,176 INFO L290 TraceCheckUtils]: 125: Hoare triple {2991#(<= |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; {2992#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:23:40,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {2992#(<= |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; {2992#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:23:40,177 INFO L290 TraceCheckUtils]: 127: Hoare triple {2992#(<= |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; {2993#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:23:40,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {2993#(<= |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; {2993#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:23:40,178 INFO L290 TraceCheckUtils]: 129: Hoare triple {2993#(<= |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; {2994#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:23:40,178 INFO L290 TraceCheckUtils]: 130: Hoare triple {2994#(<= |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; {2994#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:23:40,179 INFO L290 TraceCheckUtils]: 131: Hoare triple {2994#(<= |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; {2995#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:23:40,179 INFO L290 TraceCheckUtils]: 132: Hoare triple {2995#(<= |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; {2995#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:23:40,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {2995#(<= |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; {2996#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:23:40,180 INFO L290 TraceCheckUtils]: 134: Hoare triple {2996#(<= |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; {2996#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:23:40,181 INFO L290 TraceCheckUtils]: 135: Hoare triple {2996#(<= |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; {2997#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:23:40,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {2997#(<= |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; {2997#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:23:40,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {2997#(<= |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; {2998#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:23:40,182 INFO L290 TraceCheckUtils]: 138: Hoare triple {2998#(<= |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; {2998#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:23:40,182 INFO L290 TraceCheckUtils]: 139: Hoare triple {2998#(<= |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; {2999#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:23:40,183 INFO L290 TraceCheckUtils]: 140: Hoare triple {2999#(<= |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; {2999#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:23:40,183 INFO L290 TraceCheckUtils]: 141: Hoare triple {2999#(<= |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; {3000#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:23:40,184 INFO L290 TraceCheckUtils]: 142: Hoare triple {3000#(<= |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; {3000#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:23:40,184 INFO L290 TraceCheckUtils]: 143: Hoare triple {3000#(<= |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; {3001#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:23:40,185 INFO L290 TraceCheckUtils]: 144: Hoare triple {3001#(<= |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; {3001#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:23:40,185 INFO L290 TraceCheckUtils]: 145: Hoare triple {3001#(<= |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; {3002#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:23:40,185 INFO L290 TraceCheckUtils]: 146: Hoare triple {3002#(<= |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; {3002#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:23:40,186 INFO L290 TraceCheckUtils]: 147: Hoare triple {3002#(<= |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; {3003#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:23:40,186 INFO L290 TraceCheckUtils]: 148: Hoare triple {3003#(<= |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; {3003#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:23:40,187 INFO L290 TraceCheckUtils]: 149: Hoare triple {3003#(<= |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; {3004#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:23:40,187 INFO L290 TraceCheckUtils]: 150: Hoare triple {3004#(<= |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; {3004#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:23:40,188 INFO L290 TraceCheckUtils]: 151: Hoare triple {3004#(<= |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; {3005#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:23:40,188 INFO L290 TraceCheckUtils]: 152: Hoare triple {3005#(<= |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; {3005#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:23:40,188 INFO L290 TraceCheckUtils]: 153: Hoare triple {3005#(<= |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; {3006#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:23:40,189 INFO L290 TraceCheckUtils]: 154: Hoare triple {3006#(<= |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; {3006#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:23:40,189 INFO L290 TraceCheckUtils]: 155: Hoare triple {3006#(<= |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; {3007#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:23:40,190 INFO L290 TraceCheckUtils]: 156: Hoare triple {3007#(<= |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; {3007#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:23:40,190 INFO L290 TraceCheckUtils]: 157: Hoare triple {3007#(<= |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; {3008#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:23:40,191 INFO L290 TraceCheckUtils]: 158: Hoare triple {3008#(<= |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; {3008#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:23:40,191 INFO L290 TraceCheckUtils]: 159: Hoare triple {3008#(<= |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; {3009#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:23:40,191 INFO L290 TraceCheckUtils]: 160: Hoare triple {3009#(<= |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; {3009#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:23:40,192 INFO L290 TraceCheckUtils]: 161: Hoare triple {3009#(<= |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; {3010#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:23:40,192 INFO L290 TraceCheckUtils]: 162: Hoare triple {3010#(<= |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; {3010#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:23:40,193 INFO L290 TraceCheckUtils]: 163: Hoare triple {3010#(<= |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; {3011#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:23:40,193 INFO L290 TraceCheckUtils]: 164: Hoare triple {3011#(<= |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; {3011#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:23:40,194 INFO L290 TraceCheckUtils]: 165: Hoare triple {3011#(<= |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; {3012#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:23:40,194 INFO L290 TraceCheckUtils]: 166: Hoare triple {3012#(<= |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; {3012#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:23:40,194 INFO L290 TraceCheckUtils]: 167: Hoare triple {3012#(<= |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; {3013#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:23:40,195 INFO L290 TraceCheckUtils]: 168: Hoare triple {3013#(<= |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; {3013#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:23:40,195 INFO L290 TraceCheckUtils]: 169: Hoare triple {3013#(<= |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; {3014#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:23:40,196 INFO L290 TraceCheckUtils]: 170: Hoare triple {3014#(<= |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; {3014#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:23:40,196 INFO L290 TraceCheckUtils]: 171: Hoare triple {3014#(<= |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; {3015#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:23:40,197 INFO L290 TraceCheckUtils]: 172: Hoare triple {3015#(<= |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; {3015#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:23:40,197 INFO L290 TraceCheckUtils]: 173: Hoare triple {3015#(<= |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; {3016#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:23:40,197 INFO L290 TraceCheckUtils]: 174: Hoare triple {3016#(<= |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; {3016#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:23:40,198 INFO L290 TraceCheckUtils]: 175: Hoare triple {3016#(<= |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; {3017#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:23:40,198 INFO L290 TraceCheckUtils]: 176: Hoare triple {3017#(<= |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; {3017#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:23:40,199 INFO L290 TraceCheckUtils]: 177: Hoare triple {3017#(<= |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; {3018#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:23:40,199 INFO L290 TraceCheckUtils]: 178: Hoare triple {3018#(<= |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; {3018#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:23:40,200 INFO L290 TraceCheckUtils]: 179: Hoare triple {3018#(<= |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; {3019#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:23:40,200 INFO L290 TraceCheckUtils]: 180: Hoare triple {3019#(<= |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; {3019#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:23:40,200 INFO L290 TraceCheckUtils]: 181: Hoare triple {3019#(<= |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; {3020#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:23:40,201 INFO L290 TraceCheckUtils]: 182: Hoare triple {3020#(<= |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; {3020#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:23:40,201 INFO L290 TraceCheckUtils]: 183: Hoare triple {3020#(<= |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; {3021#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:23:40,202 INFO L290 TraceCheckUtils]: 184: Hoare triple {3021#(<= |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; {3021#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:23:40,202 INFO L290 TraceCheckUtils]: 185: Hoare triple {3021#(<= |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; {3022#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:23:40,202 INFO L290 TraceCheckUtils]: 186: Hoare triple {3022#(<= |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; {3022#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:23:40,203 INFO L290 TraceCheckUtils]: 187: Hoare triple {3022#(<= |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; {3023#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:23:40,203 INFO L290 TraceCheckUtils]: 188: Hoare triple {3023#(<= |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; {3023#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:23:40,204 INFO L290 TraceCheckUtils]: 189: Hoare triple {3023#(<= |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; {3024#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:23:40,204 INFO L290 TraceCheckUtils]: 190: Hoare triple {3024#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(main_~i~0#1 < 1048); {2929#false} is VALID [2022-02-21 03:23:40,209 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:40,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:40,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582974346] [2022-02-21 03:23:40,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582974346] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:40,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75549747] [2022-02-21 03:23:40,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:23:40,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:40,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:40,219 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:40,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process