./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_sentinel-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/standard_sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:26,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:26,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:26,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:26,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:26,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:26,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:26,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:26,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:26,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:26,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:26,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:26,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:26,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:26,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:26,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:26,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:26,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:26,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:26,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:26,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:26,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:26,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:26,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:26,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:26,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:26,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:26,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:26,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:26,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:26,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:26,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:26,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:26,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:26,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:26,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:26,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:26,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:26,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:26,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:26,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:26,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:26,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:26,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:26,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:26,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:26,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:26,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:26,136 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:26,136 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:26,136 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:26,136 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:26,137 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:26,137 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:26,137 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:26,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:26,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:26,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:26,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:26,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:26,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:26,140 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:26,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:26,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:26,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:26,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:26,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:26,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:26,141 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:26,142 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 [2022-02-21 03:36:26,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:26,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:26,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:26,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:26,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:26,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_sentinel-2.i [2022-02-21 03:36:26,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7974660/44c85baa85f049518919b18003748ce8/FLAG2b8f0729c [2022-02-21 03:36:26,822 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:26,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i [2022-02-21 03:36:26,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7974660/44c85baa85f049518919b18003748ce8/FLAG2b8f0729c [2022-02-21 03:36:26,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7974660/44c85baa85f049518919b18003748ce8 [2022-02-21 03:36:26,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:26,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:26,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:26,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:26,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:26,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:26" (1/1) ... [2022-02-21 03:36:26,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c409b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:26, skipping insertion in model container [2022-02-21 03:36:26,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:26" (1/1) ... [2022-02-21 03:36:26,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:26,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:27,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2022-02-21 03:36:27,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:27,071 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:27,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2022-02-21 03:36:27,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:27,110 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:27,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27 WrapperNode [2022-02-21 03:36:27,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:27,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:27,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:27,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:27,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,147 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-21 03:36:27,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:27,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:27,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:27,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:27,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:27,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:27,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:27,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:27,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (1/1) ... [2022-02-21 03:36:27,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:27,279 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:27,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:27,420 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:27,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:27,426 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:36:27,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:27 BoogieIcfgContainer [2022-02-21 03:36:27,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:27,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:27,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:27,431 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:27,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:27,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:26" (1/3) ... [2022-02-21 03:36:27,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22bc8bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:27, skipping insertion in model container [2022-02-21 03:36:27,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:27,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:27" (2/3) ... [2022-02-21 03:36:27,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22bc8bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:27, skipping insertion in model container [2022-02-21 03:36:27,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:27,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:27" (3/3) ... [2022-02-21 03:36:27,435 INFO L388 chiAutomizerObserver]: Analyzing ICFG standard_sentinel-2.i [2022-02-21 03:36:27,487 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:27,491 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:27,492 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:27,492 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:27,492 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:27,492 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:27,492 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:27,493 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:27,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:27,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:36:27,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:27,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:27,532 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:27,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:27,532 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:27,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:27,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:36:27,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:27,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:27,537 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:27,537 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:27,543 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 11#L20-3true [2022-02-21 03:36:27,543 INFO L793 eck$LassoCheckResult]: Loop: 11#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 12#L20-2true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 11#L20-3true [2022-02-21 03:36:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:27,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:27,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302838395] [2022-02-21 03:36:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,656 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:36:27,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:27,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801980641] [2022-02-21 03:36:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:36:27,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:27,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837167330] [2022-02-21 03:36:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,741 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:28,119 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:28,122 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:28,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:28,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:28,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:28,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,123 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:28,123 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:28,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_sentinel-2.i_Iteration1_Lasso [2022-02-21 03:36:28,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:28,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:28,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:28,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:28,731 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:28,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:28,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:28,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:36:28,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:36:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:28,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:28,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:28,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:28,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:28,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:28,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:28,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:28,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:28,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:28,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:28,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:28,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:28,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:28,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:28,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:28,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:28,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:28,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:28,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:28,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:28,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:28,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:28,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:28,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:28,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:28,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:28,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:29,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:29,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:29,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:29,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,044 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:36:29,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:29,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:29,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:29,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:29,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:29,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:29,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:29,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:29,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,330 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:36:29,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:36:29,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,404 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:36:29,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:36:29,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,514 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:36:29,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:29,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,577 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:36:29,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:29,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:29,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:29,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:29,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:29,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:29,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:29,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:29,635 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:36:29,635 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:29,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,640 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:29,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:36:29,721 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:29,721 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:29,721 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) = 199999*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:36:29,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:29,786 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:36:29,799 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1;" "main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2022-02-21 03:36:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {25#unseeded} is VALID [2022-02-21 03:36:29,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:36:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {71#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:29,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {71#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {63#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:36:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:30,038 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:36:30,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,044 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:30,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 36 states and 50 transitions. Complement of second has 8 states. [2022-02-21 03:36:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:30,153 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:30,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:36:30,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,156 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:36:30,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:30,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 50 transitions. [2022-02-21 03:36:30,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,164 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:36:30,166 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:30,166 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:36:30,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:30,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:30,169 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 50 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:30,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:30,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,170 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:36:30,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:30,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:30,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,171 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:36:30,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:30,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,172 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:36:30,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:30,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 36 letters. Loop has 36 letters. [2022-02-21 03:36:30,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,173 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 36 letters. Loop has 36 letters. [2022-02-21 03:36:30,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:36:30,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 15 letters. Loop has 15 letters. [2022-02-21 03:36:30,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,174 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 15 letters. Loop has 15 letters. [2022-02-21 03:36:30,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:36:30,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:30,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,174 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:36:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,175 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:36:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,176 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:36:30,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:36:30,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,177 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:36:30,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:30,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,177 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:36:30,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:30,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:30,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,178 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:36:30,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:30,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:30,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,179 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:36:30,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:30,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,180 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:36:30,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:36:30,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:30,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,181 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:36:30,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 50 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:30,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,181 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:30,185 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:36:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-21 03:36:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:30,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:30,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:30,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:30,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:30,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 8 states and 10 transitions. [2022-02-21 03:36:30,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:36:30,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:30,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-02-21 03:36:30,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:30,195 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:36:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-02-21 03:36:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:36:30,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:30,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,215 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,217 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,220 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:36:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:36:30,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 10 transitions. [2022-02-21 03:36:30,221 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 10 transitions. [2022-02-21 03:36:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,222 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2022-02-21 03:36:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:36:30,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:30,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:36:30,225 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:36:30,225 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:36:30,225 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:30,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:36:30,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,226 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:30,226 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:30,226 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 124#L20-3 assume !(main_~i~0#1 < 100000); 125#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 129#L28-3 [2022-02-21 03:36:30,227 INFO L793 eck$LassoCheckResult]: Loop: 129#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 128#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 129#L28-3 [2022-02-21 03:36:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 925709, now seen corresponding path program 1 times [2022-02-21 03:36:30,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416081311] [2022-02-21 03:36:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {149#true} is VALID [2022-02-21 03:36:30,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {151#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {150#false} is VALID [2022-02-21 03:36:30,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {150#false} is VALID [2022-02-21 03:36:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:30,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416081311] [2022-02-21 03:36:30,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416081311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:30,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:30,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:30,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048603382] [2022-02-21 03:36:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:30,280 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2022-02-21 03:36:30,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508275316] [2022-02-21 03:36:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,298 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:30,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:30,346 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,372 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:36:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:30,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:30,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-02-21 03:36:30,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:36:30,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:30,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:30,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-02-21 03:36:30,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:30,385 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:36:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-02-21 03:36:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:36:30,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:30,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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:36:30,386 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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:36:30,387 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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:36:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,388 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:36:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:36:30,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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 9 states and 10 transitions. [2022-02-21 03:36:30,389 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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 9 states and 10 transitions. [2022-02-21 03:36:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,390 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:36:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:36:30,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:30,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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:36:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-02-21 03:36:30,391 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:36:30,391 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:36:30,392 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:30,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:36:30,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:30,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:30,393 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 169#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 165#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 166#L20-3 assume !(main_~i~0#1 < 100000); 170#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 168#L28-3 [2022-02-21 03:36:30,393 INFO L793 eck$LassoCheckResult]: Loop: 168#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 167#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 168#L28-3 [2022-02-21 03:36:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 889660431, now seen corresponding path program 1 times [2022-02-21 03:36:30,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908996194] [2022-02-21 03:36:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {192#true} is VALID [2022-02-21 03:36:30,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {194#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {194#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {195#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {193#false} is VALID [2022-02-21 03:36:30,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {193#false} is VALID [2022-02-21 03:36:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:30,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908996194] [2022-02-21 03:36:30,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908996194] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:30,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935247595] [2022-02-21 03:36:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:30,460 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:30,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-21 03:36:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:36:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:30,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:30,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {192#true} is VALID [2022-02-21 03:36:30,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {202#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {195#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {193#false} is VALID [2022-02-21 03:36:30,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {193#false} is VALID [2022-02-21 03:36:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:30,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {193#false} is VALID [2022-02-21 03:36:30,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {193#false} is VALID [2022-02-21 03:36:30,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {222#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {218#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:30,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {222#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:30,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {222#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:30,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {192#true} is VALID [2022-02-21 03:36:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935247595] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:30,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:30,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:36:30,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937669019] [2022-02-21 03:36:30,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:30,620 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2022-02-21 03:36:30,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5553693] [2022-02-21 03:36:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,630 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:30,672 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:36:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,721 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:36:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:36:30,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:36:30,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:30,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2022-02-21 03:36:30,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:30,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:30,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:30,743 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:36:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:36:30,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:30,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,745 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,745 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,746 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:36:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 15 transitions. [2022-02-21 03:36:30,749 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 15 transitions. [2022-02-21 03:36:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,750 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:36:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:30,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-21 03:36:30,752 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:36:30,752 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:36:30,752 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:30,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:36:30,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:30,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-02-21 03:36:30,755 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:30,756 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 247#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 248#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 249#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 250#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 251#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 258#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 257#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 256#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 255#L20-3 assume !(main_~i~0#1 < 100000); 254#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 253#L28-3 [2022-02-21 03:36:30,756 INFO L793 eck$LassoCheckResult]: Loop: 253#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 252#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 253#L28-3 [2022-02-21 03:36:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 833936661, now seen corresponding path program 2 times [2022-02-21 03:36:30,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637640795] [2022-02-21 03:36:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {290#true} is VALID [2022-02-21 03:36:30,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {292#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {292#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:30,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:30,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {296#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:30,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {291#false} is VALID [2022-02-21 03:36:30,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {291#false} is VALID [2022-02-21 03:36:30,843 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:36:30,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:30,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637640795] [2022-02-21 03:36:30,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637640795] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:30,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902482169] [2022-02-21 03:36:30,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:30,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:30,852 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:30,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-21 03:36:30,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:30,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:31,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {290#true} is VALID [2022-02-21 03:36:31,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {303#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {303#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {303#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {296#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:31,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {291#false} is VALID [2022-02-21 03:36:31,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {291#false} is VALID [2022-02-21 03:36:31,021 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:36:31,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:31,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {291#false} is VALID [2022-02-21 03:36:31,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {291#false} is VALID [2022-02-21 03:36:31,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {337#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:31,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {341#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:31,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {341#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:31,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {348#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:31,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {348#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:31,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {355#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {355#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:31,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {355#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:31,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {362#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:31,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {362#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:31,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {290#true} is VALID [2022-02-21 03:36:31,150 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:36:31,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902482169] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:31,150 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:31,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:36:31,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102617253] [2022-02-21 03:36:31,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:31,151 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2022-02-21 03:36:31,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683838340] [2022-02-21 03:36:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,160 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:31,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:31,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:36:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:36:31,195 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,263 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-21 03:36:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:31,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:31,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:31,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2022-02-21 03:36:31,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:31,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:31,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:31,293 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-21 03:36:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-21 03:36:31,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:31,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 27 transitions. Second operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,296 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 27 transitions. Second operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,297 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,298 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-21 03:36:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:31,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:31,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 27 transitions. [2022-02-21 03:36:31,300 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 27 transitions. [2022-02-21 03:36:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,301 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-21 03:36:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:31,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:31,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:31,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-21 03:36:31,303 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-21 03:36:31,303 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-21 03:36:31,303 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:31,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2022-02-21 03:36:31,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:31,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:31,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:31,308 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-02-21 03:36:31,308 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:31,308 INFO L791 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 401#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 402#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 403#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 399#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 400#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 422#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 421#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 420#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 419#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 418#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 417#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 416#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 415#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 414#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 413#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 412#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 411#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 410#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 409#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 408#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 407#L20-3 assume !(main_~i~0#1 < 100000); 406#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 405#L28-3 [2022-02-21 03:36:31,308 INFO L793 eck$LassoCheckResult]: Loop: 405#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 404#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 405#L28-3 [2022-02-21 03:36:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272353, now seen corresponding path program 3 times [2022-02-21 03:36:31,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938272145] [2022-02-21 03:36:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {478#true} is VALID [2022-02-21 03:36:31,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {480#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {480#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {480#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:31,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:31,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:31,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:31,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:31,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:31,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:31,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:31,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:31,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:31,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:31,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:31,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {490#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:31,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {490#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {479#false} is VALID [2022-02-21 03:36:31,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {479#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {479#false} is VALID [2022-02-21 03:36:31,519 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:36:31,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:31,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938272145] [2022-02-21 03:36:31,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938272145] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:31,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551046857] [2022-02-21 03:36:31,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:31,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:31,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,522 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-21 03:36:31,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:36:31,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:31,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:36:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:31,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {478#true} is VALID [2022-02-21 03:36:31,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {497#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {497#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:31,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:31,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:31,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:31,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:31,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:31,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:31,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:31,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:31,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:31,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {488#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:31,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:31,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {489#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {490#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:31,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {490#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {479#false} is VALID [2022-02-21 03:36:31,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {479#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {479#false} is VALID [2022-02-21 03:36:31,851 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:36:31,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:32,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {479#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {479#false} is VALID [2022-02-21 03:36:32,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {479#false} is VALID [2022-02-21 03:36:32,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {571#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {567#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:32,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {571#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:32,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {571#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:32,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {578#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:32,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {585#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {578#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:32,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {585#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {585#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:32,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {592#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {585#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:32,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {592#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:32,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {592#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:32,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {599#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:32,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {599#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:32,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {606#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {606#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:32,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {606#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:32,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {613#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:32,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {620#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {613#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:32,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {620#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:32,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {627#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {620#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:32,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {627#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {627#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:32,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {627#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:32,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {634#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:32,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {634#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:32,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {478#true} is VALID [2022-02-21 03:36:32,231 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:36:32,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551046857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:32,232 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:32,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:36:32,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006744142] [2022-02-21 03:36:32,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:32,232 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2022-02-21 03:36:32,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128832755] [2022-02-21 03:36:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,238 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,241 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:36:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:36:32,278 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,424 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-21 03:36:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:36:32,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:32,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:32,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2022-02-21 03:36:32,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:32,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:32,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:32,479 INFO L681 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-02-21 03:36:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-21 03:36:32,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:32,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 51 transitions. Second operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,482 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 51 transitions. Second operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,482 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,484 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-21 03:36:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states and 51 transitions. [2022-02-21 03:36:32,485 INFO L87 Difference]: Start difference. First operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states and 51 transitions. [2022-02-21 03:36:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,486 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-02-21 03:36:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:32,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-02-21 03:36:32,489 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-02-21 03:36:32,489 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-02-21 03:36:32,489 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:32,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2022-02-21 03:36:32,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:32,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,490 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2022-02-21 03:36:32,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:32,491 INFO L791 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 695#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 696#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 697#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 698#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 699#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 742#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 741#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 740#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 739#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 738#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 737#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 736#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 735#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 734#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 733#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 732#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 731#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 730#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 729#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 728#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 727#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 726#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 725#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 724#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 723#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 722#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 721#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 720#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 719#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 718#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 717#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 716#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 715#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 714#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 713#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 712#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 711#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 710#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 709#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 708#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 707#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 706#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 705#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 704#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 703#L20-3 assume !(main_~i~0#1 < 100000); 702#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 701#L28-3 [2022-02-21 03:36:32,491 INFO L793 eck$LassoCheckResult]: Loop: 701#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 700#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 701#L28-3 [2022-02-21 03:36:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 828161209, now seen corresponding path program 4 times [2022-02-21 03:36:32,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971541105] [2022-02-21 03:36:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {846#true} is VALID [2022-02-21 03:36:32,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {848#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {848#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {848#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:32,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:32,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:32,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:32,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:32,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:32,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:32,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:32,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:32,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:32,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:32,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:32,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:32,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:32,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:32,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:32,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:32,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:32,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:32,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:32,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:32,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:32,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:32,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:32,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:32,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:32,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:32,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:32,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:32,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:32,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:32,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:32,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {870#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:32,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {870#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {847#false} is VALID [2022-02-21 03:36:32,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {847#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {847#false} is VALID [2022-02-21 03:36:32,953 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:36:32,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:32,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971541105] [2022-02-21 03:36:32,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971541105] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:32,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918932965] [2022-02-21 03:36:32,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:36:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:32,957 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:32,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-21 03:36:33,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:36:33,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:33,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:36:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:33,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {846#true} is VALID [2022-02-21 03:36:33,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {877#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {877#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {877#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:33,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:33,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:33,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:33,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {854#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:33,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:33,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {855#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:33,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:33,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:33,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:33,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:33,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:33,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:33,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:33,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {859#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:33,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:33,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:33,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:33,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {861#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:33,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:33,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:33,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:33,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:33,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:33,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:33,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:33,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:33,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:33,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:33,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:33,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:33,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:33,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:33,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:33,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {870#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:33,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {870#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {847#false} is VALID [2022-02-21 03:36:33,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {847#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {847#false} is VALID [2022-02-21 03:36:33,463 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:36:33,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:34,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {847#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {847#false} is VALID [2022-02-21 03:36:34,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {1019#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {847#false} is VALID [2022-02-21 03:36:34,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {1023#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1019#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:34,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {1023#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1023#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:34,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {1030#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1023#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:34,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {1030#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1030#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {1037#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1030#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {1037#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1037#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:34,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {1044#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1037#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:34,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {1044#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1044#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {1051#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1044#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {1051#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1051#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {1058#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1051#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:34,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {1058#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1058#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {1065#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1058#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {1065#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1065#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:34,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {1072#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1065#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:34,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1072#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {1079#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1072#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {1079#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1079#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:34,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {1086#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1079#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:34,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1086#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1086#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:34,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {1093#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1086#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:34,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {1093#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1093#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-21 03:36:34,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {1100#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1093#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-21 03:36:34,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1100#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:34,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1100#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:34,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {1107#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1107#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-21 03:36:34,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {1114#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1107#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-21 03:36:34,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {1114#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1114#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:34,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1114#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:34,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1121#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-21 03:36:34,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1121#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-21 03:36:34,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {1128#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1128#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:34,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1135#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1128#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:34,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1135#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1135#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-21 03:36:34,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1142#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1135#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-21 03:36:34,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1142#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1142#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:34,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1149#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1142#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:34,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1149#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-21 03:36:34,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1149#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-21 03:36:34,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {1156#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1156#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:34,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {1163#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1156#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:34,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {1163#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1163#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-21 03:36:34,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {1170#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1163#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-21 03:36:34,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1170#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:34,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {1170#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:34,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {846#true} is VALID [2022-02-21 03:36:34,525 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:36:34,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918932965] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:34,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:34,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-21 03:36:34,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476404959] [2022-02-21 03:36:34,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,526 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2022-02-21 03:36:34,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608701383] [2022-02-21 03:36:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,544 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:34,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-21 03:36:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-21 03:36:34,587 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,830 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-21 03:36:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:36:34,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:34,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:34,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2022-02-21 03:36:34,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:34,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:34,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:34,928 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-02-21 03:36:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-21 03:36:34,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:34,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states and 99 transitions. Second operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,938 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states and 99 transitions. Second operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,938 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,941 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-21 03:36:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states and 99 transitions. [2022-02-21 03:36:34,943 INFO L87 Difference]: Start difference. First operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states and 99 transitions. [2022-02-21 03:36:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:34,946 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-21 03:36:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:34,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:34,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:34,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-02-21 03:36:34,952 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-02-21 03:36:34,952 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-02-21 03:36:34,952 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:34,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2022-02-21 03:36:34,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:34,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:34,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:34,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2022-02-21 03:36:34,957 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:34,958 INFO L791 eck$LassoCheckResult]: Stem: 1277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 1278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 1279#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1280#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1281#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1282#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1283#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1374#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1373#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1372#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1371#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1370#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1369#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1368#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1367#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1366#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1365#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1364#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1363#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1362#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1361#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1360#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1359#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1358#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1357#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1356#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1355#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1354#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1353#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1352#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1351#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1350#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1349#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1348#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1347#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1346#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1345#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1344#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1343#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1342#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1341#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1340#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1339#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1338#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1337#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1336#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1335#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1334#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1333#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1332#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1331#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1330#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1329#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1328#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1327#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1326#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1325#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1324#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1323#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1322#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1321#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1320#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1319#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1318#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1317#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1316#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1315#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1314#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1313#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1312#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1311#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1310#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1309#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1308#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1307#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1306#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1305#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1304#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1303#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1302#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1301#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1300#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1299#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1298#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1297#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1296#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1295#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1294#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1293#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1292#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1291#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1290#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1289#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1288#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1287#L20-3 assume !(main_~i~0#1 < 100000); 1286#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 1285#L28-3 [2022-02-21 03:36:34,961 INFO L793 eck$LassoCheckResult]: Loop: 1285#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 1284#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 1285#L28-3 [2022-02-21 03:36:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash 830581481, now seen corresponding path program 5 times [2022-02-21 03:36:34,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609538616] [2022-02-21 03:36:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:36,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {1574#true} is VALID [2022-02-21 03:36:36,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {1576#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1576#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {1576#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:36,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:36,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:36,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:36,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:36,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:36,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:36,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:36,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:36,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:36,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:36,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:36,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:36,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:36,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:36,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:36,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:36,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:36,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:36,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:36,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:36,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:36,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:36,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:36,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:36,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:36,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:36,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:36,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:36,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:36,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:36,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:36,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:36,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:36,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:36,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:36,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:36,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:36,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:36,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:36,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:36,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:36,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:36,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:36,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:36,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:36,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:36,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:36,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:36,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:36,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:36,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:36,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:36,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:36,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:36,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:36,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:36,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:36,117 INFO L290 TraceCheckUtils]: 71: Hoare triple {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:36,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:36,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:36,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:36,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:36,119 INFO L290 TraceCheckUtils]: 76: Hoare triple {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:36,119 INFO L290 TraceCheckUtils]: 77: Hoare triple {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:36,120 INFO L290 TraceCheckUtils]: 78: Hoare triple {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:36,120 INFO L290 TraceCheckUtils]: 79: Hoare triple {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:36,120 INFO L290 TraceCheckUtils]: 80: Hoare triple {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:36,121 INFO L290 TraceCheckUtils]: 81: Hoare triple {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:36,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:36,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:36,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:36,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:36,125 INFO L290 TraceCheckUtils]: 86: Hoare triple {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:36,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:36,126 INFO L290 TraceCheckUtils]: 88: Hoare triple {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:36,126 INFO L290 TraceCheckUtils]: 89: Hoare triple {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:36,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:36,127 INFO L290 TraceCheckUtils]: 91: Hoare triple {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:36,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:36,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1622#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:36,134 INFO L290 TraceCheckUtils]: 94: Hoare triple {1622#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {1575#false} is VALID [2022-02-21 03:36:36,134 INFO L290 TraceCheckUtils]: 95: Hoare triple {1575#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {1575#false} is VALID [2022-02-21 03:36:36,135 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:36:36,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:36,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609538616] [2022-02-21 03:36:36,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609538616] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:36,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840747697] [2022-02-21 03:36:36,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:36,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:36,137 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:36,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-21 03:36:38,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-21 03:36:38,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:38,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:36:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:38,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:39,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {1574#true} is VALID [2022-02-21 03:36:39,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {1629#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:39,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1629#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:39,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:39,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:39,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {1577#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:39,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:39,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {1578#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:39,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:39,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:39,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:39,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:39,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:39,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1581#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:39,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:39,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:39,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:39,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1583#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:39,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:39,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {1584#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:39,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:39,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:39,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:39,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1586#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:39,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:39,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {1587#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:39,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:39,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:39,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:39,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:39,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:39,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1590#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:39,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:39,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {1591#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:39,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:39,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {1592#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:39,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:39,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {1593#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:39,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:39,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {1594#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:39,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:39,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {1595#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:39,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:39,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {1596#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:39,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:39,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {1597#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:39,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:39,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {1598#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:39,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:39,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {1599#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:39,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:39,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {1600#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:39,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:39,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {1601#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:39,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:39,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {1602#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:39,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:39,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {1603#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:39,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:39,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {1604#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:39,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:39,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {1605#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:39,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:39,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {1606#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:39,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:39,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {1607#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:39,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:39,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {1608#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:39,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:39,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {1609#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:39,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:39,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {1610#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:39,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:39,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {1611#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:39,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:39,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {1612#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:39,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:39,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {1613#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:39,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:39,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {1614#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:39,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:39,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {1615#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:39,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:39,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {1616#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:39,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:39,372 INFO L290 TraceCheckUtils]: 85: Hoare triple {1617#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:39,372 INFO L290 TraceCheckUtils]: 86: Hoare triple {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:39,384 INFO L290 TraceCheckUtils]: 87: Hoare triple {1618#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:39,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:39,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {1619#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:39,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:39,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {1620#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:39,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:39,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {1621#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1622#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:39,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {1622#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {1575#false} is VALID [2022-02-21 03:36:39,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {1575#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {1575#false} is VALID [2022-02-21 03:36:39,389 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:36:39,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:42,413 INFO L290 TraceCheckUtils]: 95: Hoare triple {1575#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {1575#false} is VALID [2022-02-21 03:36:42,413 INFO L290 TraceCheckUtils]: 94: Hoare triple {1915#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1575#false} is VALID [2022-02-21 03:36:42,414 INFO L290 TraceCheckUtils]: 93: Hoare triple {1919#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1915#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:42,414 INFO L290 TraceCheckUtils]: 92: Hoare triple {1919#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1919#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:42,415 INFO L290 TraceCheckUtils]: 91: Hoare triple {1926#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1919#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:42,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {1926#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1926#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:42,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {1933#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1926#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:42,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {1933#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1933#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:42,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {1940#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1933#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:42,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {1940#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1940#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:42,417 INFO L290 TraceCheckUtils]: 85: Hoare triple {1947#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1940#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:42,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {1947#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1947#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:42,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {1954#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1947#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:42,418 INFO L290 TraceCheckUtils]: 82: Hoare triple {1954#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1954#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:42,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {1961#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1954#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:42,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {1961#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1961#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:42,419 INFO L290 TraceCheckUtils]: 79: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1961#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:42,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {1968#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1968#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:42,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {1975#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1968#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:42,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {1975#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1975#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:42,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {1982#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1975#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:42,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {1982#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1982#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:42,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {1989#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1982#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:42,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {1989#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1989#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-21 03:36:42,421 INFO L290 TraceCheckUtils]: 71: Hoare triple {1996#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1989#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-21 03:36:42,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {1996#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {1996#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:42,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {2003#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1996#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-21 03:36:42,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {2003#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2003#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-21 03:36:42,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {2010#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2003#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-21 03:36:42,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {2010#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2010#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:42,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {2017#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2010#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-21 03:36:42,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {2017#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2017#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-21 03:36:42,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {2024#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2017#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-21 03:36:42,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {2024#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2024#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:42,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {2031#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2024#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-21 03:36:42,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {2031#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2031#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-21 03:36:42,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {2038#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2031#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-21 03:36:42,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {2038#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2038#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:42,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {2045#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2038#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-21 03:36:42,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {2045#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2045#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-21 03:36:42,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {2052#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2045#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-21 03:36:42,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {2052#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2052#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:42,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {2059#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2052#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-21 03:36:42,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {2059#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2059#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-21 03:36:42,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {2066#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2059#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-21 03:36:42,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {2066#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2066#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:42,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {2073#(< |ULTIMATE.start_main_~i~0#1| 99977)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2066#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-21 03:36:42,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {2073#(< |ULTIMATE.start_main_~i~0#1| 99977)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2073#(< |ULTIMATE.start_main_~i~0#1| 99977)} is VALID [2022-02-21 03:36:42,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {2080#(< |ULTIMATE.start_main_~i~0#1| 99976)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2073#(< |ULTIMATE.start_main_~i~0#1| 99977)} is VALID [2022-02-21 03:36:42,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {2080#(< |ULTIMATE.start_main_~i~0#1| 99976)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2080#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:36:42,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {2087#(< |ULTIMATE.start_main_~i~0#1| 99975)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2080#(< |ULTIMATE.start_main_~i~0#1| 99976)} is VALID [2022-02-21 03:36:42,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {2087#(< |ULTIMATE.start_main_~i~0#1| 99975)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2087#(< |ULTIMATE.start_main_~i~0#1| 99975)} is VALID [2022-02-21 03:36:42,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {2094#(< |ULTIMATE.start_main_~i~0#1| 99974)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2087#(< |ULTIMATE.start_main_~i~0#1| 99975)} is VALID [2022-02-21 03:36:42,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {2094#(< |ULTIMATE.start_main_~i~0#1| 99974)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2094#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:36:42,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {2101#(< |ULTIMATE.start_main_~i~0#1| 99973)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2094#(< |ULTIMATE.start_main_~i~0#1| 99974)} is VALID [2022-02-21 03:36:42,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {2101#(< |ULTIMATE.start_main_~i~0#1| 99973)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2101#(< |ULTIMATE.start_main_~i~0#1| 99973)} is VALID [2022-02-21 03:36:42,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {2108#(< |ULTIMATE.start_main_~i~0#1| 99972)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2101#(< |ULTIMATE.start_main_~i~0#1| 99973)} is VALID [2022-02-21 03:36:42,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {2108#(< |ULTIMATE.start_main_~i~0#1| 99972)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2108#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:36:42,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {2115#(< |ULTIMATE.start_main_~i~0#1| 99971)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2108#(< |ULTIMATE.start_main_~i~0#1| 99972)} is VALID [2022-02-21 03:36:42,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {2115#(< |ULTIMATE.start_main_~i~0#1| 99971)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2115#(< |ULTIMATE.start_main_~i~0#1| 99971)} is VALID [2022-02-21 03:36:42,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {2122#(< |ULTIMATE.start_main_~i~0#1| 99970)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#(< |ULTIMATE.start_main_~i~0#1| 99971)} is VALID [2022-02-21 03:36:42,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {2122#(< |ULTIMATE.start_main_~i~0#1| 99970)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2122#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:36:42,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {2129#(< |ULTIMATE.start_main_~i~0#1| 99969)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2122#(< |ULTIMATE.start_main_~i~0#1| 99970)} is VALID [2022-02-21 03:36:42,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {2129#(< |ULTIMATE.start_main_~i~0#1| 99969)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2129#(< |ULTIMATE.start_main_~i~0#1| 99969)} is VALID [2022-02-21 03:36:42,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {2136#(< |ULTIMATE.start_main_~i~0#1| 99968)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2129#(< |ULTIMATE.start_main_~i~0#1| 99969)} is VALID [2022-02-21 03:36:42,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {2136#(< |ULTIMATE.start_main_~i~0#1| 99968)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2136#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:36:42,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {2143#(< |ULTIMATE.start_main_~i~0#1| 99967)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2136#(< |ULTIMATE.start_main_~i~0#1| 99968)} is VALID [2022-02-21 03:36:42,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {2143#(< |ULTIMATE.start_main_~i~0#1| 99967)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2143#(< |ULTIMATE.start_main_~i~0#1| 99967)} is VALID [2022-02-21 03:36:42,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {2150#(< |ULTIMATE.start_main_~i~0#1| 99966)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2143#(< |ULTIMATE.start_main_~i~0#1| 99967)} is VALID [2022-02-21 03:36:42,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {2150#(< |ULTIMATE.start_main_~i~0#1| 99966)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2150#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:36:42,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {2157#(< |ULTIMATE.start_main_~i~0#1| 99965)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2150#(< |ULTIMATE.start_main_~i~0#1| 99966)} is VALID [2022-02-21 03:36:42,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {2157#(< |ULTIMATE.start_main_~i~0#1| 99965)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2157#(< |ULTIMATE.start_main_~i~0#1| 99965)} is VALID [2022-02-21 03:36:42,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {2164#(< |ULTIMATE.start_main_~i~0#1| 99964)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2157#(< |ULTIMATE.start_main_~i~0#1| 99965)} is VALID [2022-02-21 03:36:42,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {2164#(< |ULTIMATE.start_main_~i~0#1| 99964)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2164#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:36:42,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {2171#(< |ULTIMATE.start_main_~i~0#1| 99963)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2164#(< |ULTIMATE.start_main_~i~0#1| 99964)} is VALID [2022-02-21 03:36:42,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {2171#(< |ULTIMATE.start_main_~i~0#1| 99963)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2171#(< |ULTIMATE.start_main_~i~0#1| 99963)} is VALID [2022-02-21 03:36:42,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {2178#(< |ULTIMATE.start_main_~i~0#1| 99962)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2171#(< |ULTIMATE.start_main_~i~0#1| 99963)} is VALID [2022-02-21 03:36:42,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {2178#(< |ULTIMATE.start_main_~i~0#1| 99962)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2178#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:36:42,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2185#(< |ULTIMATE.start_main_~i~0#1| 99961)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2178#(< |ULTIMATE.start_main_~i~0#1| 99962)} is VALID [2022-02-21 03:36:42,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#(< |ULTIMATE.start_main_~i~0#1| 99961)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2185#(< |ULTIMATE.start_main_~i~0#1| 99961)} is VALID [2022-02-21 03:36:42,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2192#(< |ULTIMATE.start_main_~i~0#1| 99960)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2185#(< |ULTIMATE.start_main_~i~0#1| 99961)} is VALID [2022-02-21 03:36:42,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(< |ULTIMATE.start_main_~i~0#1| 99960)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2192#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:36:42,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {2199#(< |ULTIMATE.start_main_~i~0#1| 99959)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2192#(< |ULTIMATE.start_main_~i~0#1| 99960)} is VALID [2022-02-21 03:36:42,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {2199#(< |ULTIMATE.start_main_~i~0#1| 99959)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2199#(< |ULTIMATE.start_main_~i~0#1| 99959)} is VALID [2022-02-21 03:36:42,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {2206#(< |ULTIMATE.start_main_~i~0#1| 99958)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2199#(< |ULTIMATE.start_main_~i~0#1| 99959)} is VALID [2022-02-21 03:36:42,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {2206#(< |ULTIMATE.start_main_~i~0#1| 99958)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2206#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:36:42,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {2213#(< |ULTIMATE.start_main_~i~0#1| 99957)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2206#(< |ULTIMATE.start_main_~i~0#1| 99958)} is VALID [2022-02-21 03:36:42,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {2213#(< |ULTIMATE.start_main_~i~0#1| 99957)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2213#(< |ULTIMATE.start_main_~i~0#1| 99957)} is VALID [2022-02-21 03:36:42,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(< |ULTIMATE.start_main_~i~0#1| 99956)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2213#(< |ULTIMATE.start_main_~i~0#1| 99957)} is VALID [2022-02-21 03:36:42,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(< |ULTIMATE.start_main_~i~0#1| 99956)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2220#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:36:42,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2227#(< |ULTIMATE.start_main_~i~0#1| 99955)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2220#(< |ULTIMATE.start_main_~i~0#1| 99956)} is VALID [2022-02-21 03:36:42,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {2227#(< |ULTIMATE.start_main_~i~0#1| 99955)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2227#(< |ULTIMATE.start_main_~i~0#1| 99955)} is VALID [2022-02-21 03:36:42,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {2234#(< |ULTIMATE.start_main_~i~0#1| 99954)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2227#(< |ULTIMATE.start_main_~i~0#1| 99955)} is VALID [2022-02-21 03:36:42,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#(< |ULTIMATE.start_main_~i~0#1| 99954)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {2234#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-21 03:36:42,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {2234#(< |ULTIMATE.start_main_~i~0#1| 99954)} is VALID [2022-02-21 03:36:42,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {1574#true} is VALID [2022-02-21 03:36:42,449 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:36:42,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840747697] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:42,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:42,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-02-21 03:36:42,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472625934] [2022-02-21 03:36:42,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:42,450 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 6 times [2022-02-21 03:36:42,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:42,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152447146] [2022-02-21 03:36:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,463 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:42,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-21 03:36:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-21 03:36:42,497 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 3 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:42,964 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2022-02-21 03:36:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:36:42,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:43,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:43,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2022-02-21 03:36:43,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:36:43,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:36:43,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:43,158 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-02-21 03:36:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-02-21 03:36:43,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:43,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states and 195 transitions. Second operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,170 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states and 195 transitions. Second operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,170 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,175 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2022-02-21 03:36:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 194 states and 195 transitions. [2022-02-21 03:36:43,177 INFO L87 Difference]: Start difference. First operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 194 states and 195 transitions. [2022-02-21 03:36:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,182 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2022-02-21 03:36:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:43,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2022-02-21 03:36:43,188 INFO L704 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-02-21 03:36:43,188 INFO L587 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-02-21 03:36:43,188 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:36:43,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2022-02-21 03:36:43,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:43,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,200 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2022-02-21 03:36:43,200 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:43,201 INFO L791 eck$LassoCheckResult]: Stem: 2437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 2438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 2439#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2440#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2441#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2442#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2443#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2630#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2629#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2628#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2627#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2626#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2625#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2624#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2623#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2622#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2620#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2619#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2618#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2617#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2616#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2615#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2614#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2613#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2612#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2611#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2610#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2609#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2608#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2607#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2606#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2605#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2604#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2603#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2602#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2601#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2600#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2599#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2598#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2597#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2596#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2595#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2594#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2593#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2592#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2591#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2590#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2589#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2588#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2587#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2586#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2585#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2584#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2583#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2582#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2581#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2580#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2579#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2578#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2577#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2576#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2575#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2574#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2573#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2572#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2571#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2570#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2569#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2568#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2567#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2566#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2565#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2564#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2563#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2562#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2561#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2560#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2559#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2558#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2557#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2556#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2555#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2554#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2553#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2552#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2551#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2550#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2549#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2548#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2547#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2546#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2545#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2544#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2543#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2542#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2541#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2540#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2539#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2538#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2537#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2536#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2535#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2534#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2533#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2532#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2531#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2530#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2529#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2528#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2527#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2526#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2525#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2524#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2523#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2522#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2521#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2520#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2519#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2518#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2517#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2516#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2515#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2514#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2513#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2512#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2511#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2510#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2509#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2508#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2507#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2506#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2505#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2504#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2503#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2502#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2501#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2500#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2499#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2498#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2497#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2496#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2495#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2494#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2493#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2492#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2491#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2490#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2489#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2488#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2487#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2486#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2485#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2484#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2483#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2482#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2481#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2480#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2479#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2478#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2477#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2476#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2475#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2474#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2473#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2472#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2471#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2470#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2469#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2468#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2467#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2466#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2465#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2464#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2463#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2462#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2461#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2460#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2459#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2458#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2457#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2456#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2455#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2454#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2453#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2452#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2451#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2450#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2449#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2448#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2447#L20-3 assume !(main_~i~0#1 < 100000); 2446#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 2445#L28-3 [2022-02-21 03:36:43,201 INFO L793 eck$LassoCheckResult]: Loop: 2445#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 2444#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 2445#L28-3 [2022-02-21 03:36:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371209, now seen corresponding path program 6 times [2022-02-21 03:36:43,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88059296] [2022-02-21 03:36:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:46,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {3022#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); {3022#true} is VALID [2022-02-21 03:36:46,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {3022#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; {3024#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:46,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3024#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:46,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {3024#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3025#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:46,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {3025#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3025#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:46,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {3025#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3026#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:46,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {3026#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3026#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:46,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {3026#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3027#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:46,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3027#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3027#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:46,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3027#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3028#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:46,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {3028#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3028#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:46,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {3028#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3029#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:46,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {3029#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3029#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:46,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {3029#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3030#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:46,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3030#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3030#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:46,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {3030#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3031#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:46,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {3031#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3031#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:46,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {3031#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3032#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:46,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {3032#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3032#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:46,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {3032#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3033#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:46,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {3033#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3033#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:46,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {3033#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3034#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:46,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {3034#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3034#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:46,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {3034#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3035#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:46,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {3035#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3035#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:46,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {3035#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3036#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:46,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {3036#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3036#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:46,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {3036#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3037#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:46,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {3037#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3037#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:46,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {3037#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3038#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:46,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {3038#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3038#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:46,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3039#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:46,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3039#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:46,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3040#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:46,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {3040#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3040#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:46,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {3040#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3041#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:46,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {3041#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3041#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:46,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {3041#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3042#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:46,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {3042#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3042#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:46,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {3042#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3043#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:46,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {3043#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3043#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:46,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {3043#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3044#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:46,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3044#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:46,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {3044#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3045#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:46,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {3045#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3045#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:46,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {3045#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3046#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:46,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {3046#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3046#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:46,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {3046#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3047#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:46,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {3047#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3047#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-21 03:36:46,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {3047#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3048#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:46,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {3048#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3048#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-21 03:36:46,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {3048#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3049#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:46,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {3049#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3049#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-21 03:36:46,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {3049#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3050#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:46,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {3050#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3050#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-21 03:36:46,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {3050#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3051#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:46,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {3051#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3051#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-21 03:36:46,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {3051#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3052#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:46,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {3052#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3052#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-21 03:36:46,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {3052#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3053#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:46,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {3053#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3053#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-21 03:36:46,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {3053#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3054#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:46,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {3054#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3054#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-21 03:36:46,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {3054#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3055#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:46,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {3055#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3055#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-21 03:36:46,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {3055#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3056#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:46,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {3056#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3056#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-21 03:36:46,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {3056#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3057#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:46,612 INFO L290 TraceCheckUtils]: 68: Hoare triple {3057#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3057#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-21 03:36:46,612 INFO L290 TraceCheckUtils]: 69: Hoare triple {3057#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3058#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:46,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {3058#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3058#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-21 03:36:46,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {3058#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3059#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:46,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {3059#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3059#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-21 03:36:46,614 INFO L290 TraceCheckUtils]: 73: Hoare triple {3059#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3060#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:46,614 INFO L290 TraceCheckUtils]: 74: Hoare triple {3060#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3060#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-21 03:36:46,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {3060#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3061#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:46,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3061#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-21 03:36:46,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3062#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:46,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {3062#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3062#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-21 03:36:46,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {3062#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3063#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:46,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {3063#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3063#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-21 03:36:46,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {3063#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3064#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:46,617 INFO L290 TraceCheckUtils]: 82: Hoare triple {3064#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3064#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-21 03:36:46,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {3064#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3065#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:46,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {3065#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3065#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-21 03:36:46,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {3065#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3066#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:46,619 INFO L290 TraceCheckUtils]: 86: Hoare triple {3066#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3066#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-21 03:36:46,620 INFO L290 TraceCheckUtils]: 87: Hoare triple {3066#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3067#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:46,620 INFO L290 TraceCheckUtils]: 88: Hoare triple {3067#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3067#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-21 03:36:46,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {3067#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3068#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:46,621 INFO L290 TraceCheckUtils]: 90: Hoare triple {3068#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3068#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-21 03:36:46,621 INFO L290 TraceCheckUtils]: 91: Hoare triple {3068#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3069#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:46,621 INFO L290 TraceCheckUtils]: 92: Hoare triple {3069#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3069#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-21 03:36:46,622 INFO L290 TraceCheckUtils]: 93: Hoare triple {3069#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3070#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:46,622 INFO L290 TraceCheckUtils]: 94: Hoare triple {3070#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3070#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-21 03:36:46,623 INFO L290 TraceCheckUtils]: 95: Hoare triple {3070#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:36:46,623 INFO L290 TraceCheckUtils]: 96: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 47)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-21 03:36:46,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 47)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3072#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:36:46,624 INFO L290 TraceCheckUtils]: 98: Hoare triple {3072#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3072#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-21 03:36:46,624 INFO L290 TraceCheckUtils]: 99: Hoare triple {3072#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3073#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:36:46,625 INFO L290 TraceCheckUtils]: 100: Hoare triple {3073#(<= |ULTIMATE.start_main_~i~0#1| 49)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3073#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-21 03:36:46,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {3073#(<= |ULTIMATE.start_main_~i~0#1| 49)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3074#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:36:46,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {3074#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3074#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-21 03:36:46,626 INFO L290 TraceCheckUtils]: 103: Hoare triple {3074#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3075#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:36:46,626 INFO L290 TraceCheckUtils]: 104: Hoare triple {3075#(<= |ULTIMATE.start_main_~i~0#1| 51)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3075#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-21 03:36:46,627 INFO L290 TraceCheckUtils]: 105: Hoare triple {3075#(<= |ULTIMATE.start_main_~i~0#1| 51)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3076#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:36:46,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {3076#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3076#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-21 03:36:46,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {3076#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3077#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:36:46,628 INFO L290 TraceCheckUtils]: 108: Hoare triple {3077#(<= |ULTIMATE.start_main_~i~0#1| 53)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3077#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-21 03:36:46,628 INFO L290 TraceCheckUtils]: 109: Hoare triple {3077#(<= |ULTIMATE.start_main_~i~0#1| 53)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3078#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:36:46,629 INFO L290 TraceCheckUtils]: 110: Hoare triple {3078#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3078#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-21 03:36:46,629 INFO L290 TraceCheckUtils]: 111: Hoare triple {3078#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3079#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:36:46,629 INFO L290 TraceCheckUtils]: 112: Hoare triple {3079#(<= |ULTIMATE.start_main_~i~0#1| 55)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3079#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-21 03:36:46,630 INFO L290 TraceCheckUtils]: 113: Hoare triple {3079#(<= |ULTIMATE.start_main_~i~0#1| 55)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3080#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:36:46,630 INFO L290 TraceCheckUtils]: 114: Hoare triple {3080#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3080#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-21 03:36:46,631 INFO L290 TraceCheckUtils]: 115: Hoare triple {3080#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:36:46,631 INFO L290 TraceCheckUtils]: 116: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 57)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-21 03:36:46,631 INFO L290 TraceCheckUtils]: 117: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 57)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3082#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:36:46,632 INFO L290 TraceCheckUtils]: 118: Hoare triple {3082#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3082#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-21 03:36:46,632 INFO L290 TraceCheckUtils]: 119: Hoare triple {3082#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3083#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:36:46,633 INFO L290 TraceCheckUtils]: 120: Hoare triple {3083#(<= |ULTIMATE.start_main_~i~0#1| 59)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3083#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-21 03:36:46,633 INFO L290 TraceCheckUtils]: 121: Hoare triple {3083#(<= |ULTIMATE.start_main_~i~0#1| 59)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3084#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:36:46,633 INFO L290 TraceCheckUtils]: 122: Hoare triple {3084#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3084#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-21 03:36:46,634 INFO L290 TraceCheckUtils]: 123: Hoare triple {3084#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3085#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:36:46,634 INFO L290 TraceCheckUtils]: 124: Hoare triple {3085#(<= |ULTIMATE.start_main_~i~0#1| 61)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3085#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-21 03:36:46,635 INFO L290 TraceCheckUtils]: 125: Hoare triple {3085#(<= |ULTIMATE.start_main_~i~0#1| 61)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3086#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:36:46,635 INFO L290 TraceCheckUtils]: 126: Hoare triple {3086#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3086#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-21 03:36:46,635 INFO L290 TraceCheckUtils]: 127: Hoare triple {3086#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3087#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:36:46,636 INFO L290 TraceCheckUtils]: 128: Hoare triple {3087#(<= |ULTIMATE.start_main_~i~0#1| 63)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3087#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-21 03:36:46,636 INFO L290 TraceCheckUtils]: 129: Hoare triple {3087#(<= |ULTIMATE.start_main_~i~0#1| 63)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3088#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:36:46,637 INFO L290 TraceCheckUtils]: 130: Hoare triple {3088#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3088#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-21 03:36:46,637 INFO L290 TraceCheckUtils]: 131: Hoare triple {3088#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3089#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:36:46,637 INFO L290 TraceCheckUtils]: 132: Hoare triple {3089#(<= |ULTIMATE.start_main_~i~0#1| 65)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3089#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-21 03:36:46,638 INFO L290 TraceCheckUtils]: 133: Hoare triple {3089#(<= |ULTIMATE.start_main_~i~0#1| 65)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3090#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:36:46,638 INFO L290 TraceCheckUtils]: 134: Hoare triple {3090#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3090#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-21 03:36:46,639 INFO L290 TraceCheckUtils]: 135: Hoare triple {3090#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3091#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:36:46,639 INFO L290 TraceCheckUtils]: 136: Hoare triple {3091#(<= |ULTIMATE.start_main_~i~0#1| 67)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3091#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-21 03:36:46,640 INFO L290 TraceCheckUtils]: 137: Hoare triple {3091#(<= |ULTIMATE.start_main_~i~0#1| 67)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3092#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:36:46,640 INFO L290 TraceCheckUtils]: 138: Hoare triple {3092#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3092#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-21 03:36:46,640 INFO L290 TraceCheckUtils]: 139: Hoare triple {3092#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3093#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:36:46,641 INFO L290 TraceCheckUtils]: 140: Hoare triple {3093#(<= |ULTIMATE.start_main_~i~0#1| 69)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3093#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-21 03:36:46,641 INFO L290 TraceCheckUtils]: 141: Hoare triple {3093#(<= |ULTIMATE.start_main_~i~0#1| 69)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3094#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:36:46,642 INFO L290 TraceCheckUtils]: 142: Hoare triple {3094#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3094#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-21 03:36:46,642 INFO L290 TraceCheckUtils]: 143: Hoare triple {3094#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3095#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:36:46,642 INFO L290 TraceCheckUtils]: 144: Hoare triple {3095#(<= |ULTIMATE.start_main_~i~0#1| 71)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3095#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-21 03:36:46,643 INFO L290 TraceCheckUtils]: 145: Hoare triple {3095#(<= |ULTIMATE.start_main_~i~0#1| 71)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3096#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:36:46,643 INFO L290 TraceCheckUtils]: 146: Hoare triple {3096#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3096#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-21 03:36:46,644 INFO L290 TraceCheckUtils]: 147: Hoare triple {3096#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3097#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:36:46,644 INFO L290 TraceCheckUtils]: 148: Hoare triple {3097#(<= |ULTIMATE.start_main_~i~0#1| 73)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3097#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-21 03:36:46,644 INFO L290 TraceCheckUtils]: 149: Hoare triple {3097#(<= |ULTIMATE.start_main_~i~0#1| 73)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3098#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:36:46,645 INFO L290 TraceCheckUtils]: 150: Hoare triple {3098#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3098#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-21 03:36:46,645 INFO L290 TraceCheckUtils]: 151: Hoare triple {3098#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3099#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:36:46,646 INFO L290 TraceCheckUtils]: 152: Hoare triple {3099#(<= |ULTIMATE.start_main_~i~0#1| 75)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3099#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-21 03:36:46,646 INFO L290 TraceCheckUtils]: 153: Hoare triple {3099#(<= |ULTIMATE.start_main_~i~0#1| 75)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3100#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:36:46,646 INFO L290 TraceCheckUtils]: 154: Hoare triple {3100#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3100#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-21 03:36:46,647 INFO L290 TraceCheckUtils]: 155: Hoare triple {3100#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3101#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:36:46,647 INFO L290 TraceCheckUtils]: 156: Hoare triple {3101#(<= |ULTIMATE.start_main_~i~0#1| 77)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3101#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-21 03:36:46,648 INFO L290 TraceCheckUtils]: 157: Hoare triple {3101#(<= |ULTIMATE.start_main_~i~0#1| 77)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3102#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:36:46,648 INFO L290 TraceCheckUtils]: 158: Hoare triple {3102#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3102#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-21 03:36:46,648 INFO L290 TraceCheckUtils]: 159: Hoare triple {3102#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3103#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:36:46,649 INFO L290 TraceCheckUtils]: 160: Hoare triple {3103#(<= |ULTIMATE.start_main_~i~0#1| 79)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3103#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-21 03:36:46,649 INFO L290 TraceCheckUtils]: 161: Hoare triple {3103#(<= |ULTIMATE.start_main_~i~0#1| 79)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3104#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:36:46,650 INFO L290 TraceCheckUtils]: 162: Hoare triple {3104#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3104#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-21 03:36:46,650 INFO L290 TraceCheckUtils]: 163: Hoare triple {3104#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3105#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:36:46,650 INFO L290 TraceCheckUtils]: 164: Hoare triple {3105#(<= |ULTIMATE.start_main_~i~0#1| 81)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3105#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-21 03:36:46,651 INFO L290 TraceCheckUtils]: 165: Hoare triple {3105#(<= |ULTIMATE.start_main_~i~0#1| 81)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3106#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:36:46,651 INFO L290 TraceCheckUtils]: 166: Hoare triple {3106#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3106#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-21 03:36:46,652 INFO L290 TraceCheckUtils]: 167: Hoare triple {3106#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3107#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:36:46,652 INFO L290 TraceCheckUtils]: 168: Hoare triple {3107#(<= |ULTIMATE.start_main_~i~0#1| 83)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3107#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-21 03:36:46,652 INFO L290 TraceCheckUtils]: 169: Hoare triple {3107#(<= |ULTIMATE.start_main_~i~0#1| 83)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3108#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:36:46,653 INFO L290 TraceCheckUtils]: 170: Hoare triple {3108#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3108#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-21 03:36:46,653 INFO L290 TraceCheckUtils]: 171: Hoare triple {3108#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3109#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:36:46,654 INFO L290 TraceCheckUtils]: 172: Hoare triple {3109#(<= |ULTIMATE.start_main_~i~0#1| 85)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3109#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-21 03:36:46,654 INFO L290 TraceCheckUtils]: 173: Hoare triple {3109#(<= |ULTIMATE.start_main_~i~0#1| 85)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3110#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:36:46,654 INFO L290 TraceCheckUtils]: 174: Hoare triple {3110#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3110#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-21 03:36:46,655 INFO L290 TraceCheckUtils]: 175: Hoare triple {3110#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3111#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:36:46,655 INFO L290 TraceCheckUtils]: 176: Hoare triple {3111#(<= |ULTIMATE.start_main_~i~0#1| 87)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3111#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-21 03:36:46,655 INFO L290 TraceCheckUtils]: 177: Hoare triple {3111#(<= |ULTIMATE.start_main_~i~0#1| 87)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3112#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:36:46,656 INFO L290 TraceCheckUtils]: 178: Hoare triple {3112#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3112#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-21 03:36:46,656 INFO L290 TraceCheckUtils]: 179: Hoare triple {3112#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3113#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:36:46,656 INFO L290 TraceCheckUtils]: 180: Hoare triple {3113#(<= |ULTIMATE.start_main_~i~0#1| 89)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3113#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-21 03:36:46,657 INFO L290 TraceCheckUtils]: 181: Hoare triple {3113#(<= |ULTIMATE.start_main_~i~0#1| 89)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3114#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:36:46,657 INFO L290 TraceCheckUtils]: 182: Hoare triple {3114#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3114#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-21 03:36:46,657 INFO L290 TraceCheckUtils]: 183: Hoare triple {3114#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3115#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:36:46,658 INFO L290 TraceCheckUtils]: 184: Hoare triple {3115#(<= |ULTIMATE.start_main_~i~0#1| 91)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3115#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-21 03:36:46,658 INFO L290 TraceCheckUtils]: 185: Hoare triple {3115#(<= |ULTIMATE.start_main_~i~0#1| 91)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3116#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:36:46,658 INFO L290 TraceCheckUtils]: 186: Hoare triple {3116#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3116#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-21 03:36:46,659 INFO L290 TraceCheckUtils]: 187: Hoare triple {3116#(<= |ULTIMATE.start_main_~i~0#1| 92)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3117#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:36:46,659 INFO L290 TraceCheckUtils]: 188: Hoare triple {3117#(<= |ULTIMATE.start_main_~i~0#1| 93)} assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; {3117#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-21 03:36:46,659 INFO L290 TraceCheckUtils]: 189: Hoare triple {3117#(<= |ULTIMATE.start_main_~i~0#1| 93)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3118#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-21 03:36:46,660 INFO L290 TraceCheckUtils]: 190: Hoare triple {3118#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(main_~i~0#1 < 100000); {3023#false} is VALID [2022-02-21 03:36:46,660 INFO L290 TraceCheckUtils]: 191: Hoare triple {3023#false} assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; {3023#false} is VALID [2022-02-21 03:36:46,663 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:36:46,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:46,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88059296] [2022-02-21 03:36:46,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88059296] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:46,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408874296] [2022-02-21 03:36:46,663 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:36:46,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:46,665 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:46,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process