./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_mul_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_mul_init.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 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:10:16,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:10:16,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:10:16,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:10:16,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:10:16,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:10:16,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:10:16,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:10:16,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:10:16,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:10:16,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:10:16,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:10:16,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:10:16,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:10:16,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:10:16,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:10:16,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:10:16,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:10:16,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:10:16,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:10:16,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:10:16,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:10:16,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:10:16,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:10:16,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:10:16,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:10:16,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:10:16,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:10:16,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:10:16,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:10:16,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:10:16,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:10:16,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:10:16,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:10:16,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:10:16,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:10:16,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:10:16,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:10:16,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:10:16,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:10:16,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:10:16,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:10:16,255 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:10:16,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:10:16,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:10:16,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:10:16,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:10:16,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:10:16,258 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:10:16,258 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:10:16,258 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:10:16,258 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:10:16,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:10:16,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:10:16,259 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:10:16,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:10:16,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:10:16,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:10:16,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:10:16,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:10:16,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:10:16,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:10:16,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:10:16,263 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:10:16,263 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 -> 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 [2021-12-14 23:10:16,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:10:16,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:10:16,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:10:16,484 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:10:16,484 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:10:16,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2021-12-14 23:10:16,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f83d7b/5cd2ee6540b14b6ab8747ce10f88a9a2/FLAGc117e53b0 [2021-12-14 23:10:16,919 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:10:16,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2021-12-14 23:10:16,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f83d7b/5cd2ee6540b14b6ab8747ce10f88a9a2/FLAGc117e53b0 [2021-12-14 23:10:16,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f83d7b/5cd2ee6540b14b6ab8747ce10f88a9a2 [2021-12-14 23:10:16,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:10:16,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:10:16,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:10:16,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:10:16,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:10:16,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:10:16" (1/1) ... [2021-12-14 23:10:16,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6d3bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:16, skipping insertion in model container [2021-12-14 23:10:16,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:10:16" (1/1) ... [2021-12-14 23:10:16,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:10:16,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:10:17,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i[807,820] [2021-12-14 23:10:17,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:10:17,125 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:10:17,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i[807,820] [2021-12-14 23:10:17,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:10:17,147 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:10:17,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17 WrapperNode [2021-12-14 23:10:17,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:10:17,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:10:17,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:10:17,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:10:17,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,170 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-12-14 23:10:17,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:10:17,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:10:17,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:10:17,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:10:17,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:10:17,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:10:17,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:10:17,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:10:17,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (1/1) ... [2021-12-14 23:10:17,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:17,226 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) [2021-12-14 23:10:17,228 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 [2021-12-14 23:10:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:10:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:10:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:10:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:10:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:10:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:10:17,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:10:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:10:17,297 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:10:17,299 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:10:17,397 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:10:17,401 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:10:17,401 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 23:10:17,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:10:17 BoogieIcfgContainer [2021-12-14 23:10:17,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:10:17,406 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:10:17,406 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:10:17,408 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:10:17,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:17,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:10:16" (1/3) ... [2021-12-14 23:10:17,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a65a4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:10:17, skipping insertion in model container [2021-12-14 23:10:17,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:17,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:17" (2/3) ... [2021-12-14 23:10:17,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a65a4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:10:17, skipping insertion in model container [2021-12-14 23:10:17,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:17,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:10:17" (3/3) ... [2021-12-14 23:10:17,412 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_mul_init.i [2021-12-14 23:10:17,439 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:10:17,439 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:10:17,439 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:10:17,439 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:10:17,439 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:10:17,440 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:10:17,440 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:10:17,440 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:10:17,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:17,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2021-12-14 23:10:17,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:17,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:17,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:10:17,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:17,464 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:10:17,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:17,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2021-12-14 23:10:17,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:17,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:17,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:10:17,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:17,470 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 4#L21-3true [2021-12-14 23:10:17,471 INFO L793 eck$LassoCheckResult]: Loop: 4#L21-3true assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 18#L21-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4#L21-3true [2021-12-14 23:10:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:10:17,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:17,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886721908] [2021-12-14 23:10:17,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:17,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,599 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-14 23:10:17,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830550993] [2021-12-14 23:10:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:17,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-14 23:10:17,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161114320] [2021-12-14 23:10:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:17,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:17,719 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:18,114 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:10:18,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:10:18,115 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:10:18,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:10:18,115 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:10:18,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:10:18,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:10:18,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration1_Lasso [2021-12-14 23:10:18,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:10:18,116 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:10:18,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:18,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:10:18,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:10:18,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,578 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) [2021-12-14 23:10:18,583 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 [2021-12-14 23:10:18,598 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 [2021-12-14 23:10:18,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:18,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:18,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:18,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,631 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 [2021-12-14 23:10:18,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,633 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) [2021-12-14 23:10:18,634 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 [2021-12-14 23:10:18,638 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 [2021-12-14 23:10:18,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:18,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:18,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:18,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,688 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 [2021-12-14 23:10:18,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,690 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) [2021-12-14 23:10:18,691 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 [2021-12-14 23:10:18,693 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 [2021-12-14 23:10:18,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:18,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:18,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:18,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,715 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 [2021-12-14 23:10:18,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,717 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) [2021-12-14 23:10:18,718 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 [2021-12-14 23:10:18,719 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 [2021-12-14 23:10:18,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:18,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:18,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,760 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 [2021-12-14 23:10:18,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,762 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) [2021-12-14 23:10:18,762 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 [2021-12-14 23:10:18,764 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 [2021-12-14 23:10:18,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:18,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:18,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:18,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:18,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,801 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) [2021-12-14 23:10:18,802 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 [2021-12-14 23:10:18,803 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 [2021-12-14 23:10:18,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:18,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:18,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,840 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 [2021-12-14 23:10:18,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,841 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) [2021-12-14 23:10:18,843 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 [2021-12-14 23:10:18,845 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 [2021-12-14 23:10:18,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:18,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:18,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,889 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 [2021-12-14 23:10:18,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,891 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) [2021-12-14 23:10:18,892 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 [2021-12-14 23:10:18,893 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 [2021-12-14 23:10:18,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:18,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:18,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:18,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,920 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 [2021-12-14 23:10:18,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,922 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) [2021-12-14 23:10:18,923 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 [2021-12-14 23:10:18,925 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 [2021-12-14 23:10:18,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:18,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:18,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:18,964 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 [2021-12-14 23:10:18,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:18,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:18,966 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) [2021-12-14 23:10:18,971 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 [2021-12-14 23:10:18,977 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 [2021-12-14 23:10:18,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:18,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:18,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:18,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:18,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:18,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:18,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,012 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 [2021-12-14 23:10:19,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,015 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) [2021-12-14 23:10:19,016 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 [2021-12-14 23:10:19,017 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 [2021-12-14 23:10:19,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,047 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 [2021-12-14 23:10:19,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,048 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) [2021-12-14 23:10:19,049 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 [2021-12-14 23:10:19,050 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 [2021-12-14 23:10:19,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,082 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 [2021-12-14 23:10:19,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,084 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) [2021-12-14 23:10:19,086 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 [2021-12-14 23:10:19,086 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 [2021-12-14 23:10:19,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,144 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 [2021-12-14 23:10:19,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,146 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) [2021-12-14 23:10:19,161 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 [2021-12-14 23:10:19,162 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 [2021-12-14 23:10:19,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,198 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 [2021-12-14 23:10:19,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,199 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) [2021-12-14 23:10:19,201 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 [2021-12-14 23:10:19,201 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 [2021-12-14 23:10:19,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:19,240 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 [2021-12-14 23:10:19,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,241 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) [2021-12-14 23:10:19,242 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 [2021-12-14 23:10:19,243 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 [2021-12-14 23:10:19,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:19,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:19,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:19,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:19,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:19,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:19,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:10:19,291 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-14 23:10:19,291 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-14 23:10:19,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:19,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,293 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) [2021-12-14 23:10:19,294 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 [2021-12-14 23:10:19,295 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:10:19,344 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:10:19,344 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:10:19,345 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 [] [2021-12-14 23:10:19,363 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 [2021-12-14 23:10:19,382 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-14 23:10:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:19,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:19,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:19,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:10:19,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:19,487 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 [2021-12-14 23:10:19,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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) [2021-12-14 23:10:19,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand 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 39 states and 57 transitions. Complement of second has 8 states. [2021-12-14 23:10:19,515 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 [2021-12-14 23:10:19,518 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) [2021-12-14 23:10:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2021-12-14 23:10:19,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-14 23:10:19,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:19,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-14 23:10:19,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:19,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-14 23:10:19,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:19,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2021-12-14 23:10:19,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-14 23:10:19,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 24 transitions. [2021-12-14 23:10:19,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-14 23:10:19,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-14 23:10:19,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2021-12-14 23:10:19,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:19,526 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-14 23:10:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2021-12-14 23:10:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-14 23:10:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2021-12-14 23:10:19,542 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-14 23:10:19,542 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-14 23:10:19,542 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:10:19,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2021-12-14 23:10:19,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-14 23:10:19,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:19,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:19,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:10:19,544 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:19,544 INFO L791 eck$LassoCheckResult]: Stem: 149#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(17, 2); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 145#L21-3 assume !(main_~i~0#1 < 100000); 146#L21-4 main_~i~0#1 := 0; 158#L26-3 [2021-12-14 23:10:19,544 INFO L793 eck$LassoCheckResult]: Loop: 158#L26-3 assume !!(main_~i~0#1 < 100000); 159#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 157#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 158#L26-3 [2021-12-14 23:10:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-14 23:10:19,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:19,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138793935] [2021-12-14 23:10:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:19,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:19,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138793935] [2021-12-14 23:10:19,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138793935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:10:19,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:10:19,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:10:19,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490410541] [2021-12-14 23:10:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:10:19,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-12-14 23:10:19,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392977464] [2021-12-14 23:10:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:19,578 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:19,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997643026] [2021-12-14 23:10:19,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,579 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:19,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:19,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 23:10:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:19,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:19,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:10:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:10:19,720 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 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) [2021-12-14 23:10:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:19,742 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-14 23:10:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:10:19,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2021-12-14 23:10:19,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:19,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 32 transitions. [2021-12-14 23:10:19,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-14 23:10:19,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-14 23:10:19,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2021-12-14 23:10:19,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:19,745 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-14 23:10:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2021-12-14 23:10:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2021-12-14 23:10:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-12-14 23:10:19,747 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-12-14 23:10:19,747 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-12-14 23:10:19,747 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:10:19,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2021-12-14 23:10:19,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:19,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:19,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:19,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:19,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:19,748 INFO L791 eck$LassoCheckResult]: Stem: 200#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(17, 2); 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 194#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 195#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 196#L21-3 assume !(main_~i~0#1 < 100000); 197#L21-4 main_~i~0#1 := 0; 210#L26-3 assume !!(main_~i~0#1 < 100000); 209#L28 [2021-12-14 23:10:19,748 INFO L793 eck$LassoCheckResult]: Loop: 209#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 206#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 207#L26-3 assume !!(main_~i~0#1 < 100000); 209#L28 [2021-12-14 23:10:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2021-12-14 23:10:19,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:19,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111367641] [2021-12-14 23:10:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:19,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111367641] [2021-12-14 23:10:19,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111367641] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865413443] [2021-12-14 23:10:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,812 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:19,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 23:10:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:19,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 23:10:19,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:19,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:19,909 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 [2021-12-14 23:10:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:19,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865413443] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:19,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:19,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-14 23:10:19,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429254169] [2021-12-14 23:10:19,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:19,934 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 2 times [2021-12-14 23:10:19,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908332463] [2021-12-14 23:10:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:19,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:19,941 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:19,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793966326] [2021-12-14 23:10:19,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:10:19,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:19,943 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) [2021-12-14 23:10:19,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-14 23:10:19,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 23:10:19,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:10:19,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:20,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:20,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:10:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:10:20,077 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:20,133 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2021-12-14 23:10:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:10:20,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2021-12-14 23:10:20,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:20,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2021-12-14 23:10:20,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-12-14 23:10:20,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-12-14 23:10:20,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2021-12-14 23:10:20,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:20,136 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 61 transitions. [2021-12-14 23:10:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2021-12-14 23:10:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2021-12-14 23:10:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-14 23:10:20,138 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-14 23:10:20,138 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-14 23:10:20,138 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:10:20,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2021-12-14 23:10:20,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:20,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:20,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:20,139 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2021-12-14 23:10:20,139 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:20,139 INFO L791 eck$LassoCheckResult]: Stem: 314#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(17, 2); 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 308#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 309#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 310#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 311#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 335#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 333#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 331#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 329#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 328#L21-3 assume !(main_~i~0#1 < 100000); 324#L21-4 main_~i~0#1 := 0; 325#L26-3 assume !!(main_~i~0#1 < 100000); 323#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 320#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 321#L26-3 assume !!(main_~i~0#1 < 100000); 339#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 338#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 337#L26-3 assume !!(main_~i~0#1 < 100000); 336#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 334#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 332#L26-3 assume !!(main_~i~0#1 < 100000); 327#L28 [2021-12-14 23:10:20,139 INFO L793 eck$LassoCheckResult]: Loop: 327#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 330#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 326#L26-3 assume !!(main_~i~0#1 < 100000); 327#L28 [2021-12-14 23:10:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1950889807, now seen corresponding path program 1 times [2021-12-14 23:10:20,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:20,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482170041] [2021-12-14 23:10:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:20,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:10:20,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482170041] [2021-12-14 23:10:20,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482170041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:20,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140130223] [2021-12-14 23:10:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:20,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:20,217 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) [2021-12-14 23:10:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-14 23:10:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:20,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:10:20,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:10:20,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:10:20,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140130223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:20,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:20,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-14 23:10:20,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206899072] [2021-12-14 23:10:20,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:20,373 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 3 times [2021-12-14 23:10:20,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:20,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898169175] [2021-12-14 23:10:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:20,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:20,377 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:20,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787469382] [2021-12-14 23:10:20,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:10:20,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:20,378 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) [2021-12-14 23:10:20,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-12-14 23:10:20,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:10:20,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:20,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-14 23:10:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:20,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:20,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 23:10:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 23:10:20,498 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:20,657 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2021-12-14 23:10:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:10:20,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 139 transitions. [2021-12-14 23:10:20,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:20,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 139 transitions. [2021-12-14 23:10:20,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2021-12-14 23:10:20,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2021-12-14 23:10:20,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 139 transitions. [2021-12-14 23:10:20,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:20,664 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 139 transitions. [2021-12-14 23:10:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 139 transitions. [2021-12-14 23:10:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 62. [2021-12-14 23:10:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 61 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2021-12-14 23:10:20,672 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2021-12-14 23:10:20,672 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2021-12-14 23:10:20,673 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:10:20,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 75 transitions. [2021-12-14 23:10:20,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:20,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:20,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:20,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 1, 1, 1, 1] [2021-12-14 23:10:20,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:20,674 INFO L791 eck$LassoCheckResult]: Stem: 605#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(17, 2); 606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 601#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 602#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 603#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 604#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 616#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 651#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 649#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 647#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 645#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 643#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 641#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 639#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 637#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 635#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 633#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 631#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 629#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 627#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 625#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 623#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 622#L21-3 assume !(main_~i~0#1 < 100000); 617#L21-4 main_~i~0#1 := 0; 618#L26-3 assume !!(main_~i~0#1 < 100000); 619#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 611#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 612#L26-3 assume !!(main_~i~0#1 < 100000); 614#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 615#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 660#L26-3 assume !!(main_~i~0#1 < 100000); 659#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 658#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 657#L26-3 assume !!(main_~i~0#1 < 100000); 656#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 655#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 654#L26-3 assume !!(main_~i~0#1 < 100000); 653#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 652#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 650#L26-3 assume !!(main_~i~0#1 < 100000); 648#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 646#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 644#L26-3 assume !!(main_~i~0#1 < 100000); 642#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 640#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 638#L26-3 assume !!(main_~i~0#1 < 100000); 636#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 634#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 632#L26-3 assume !!(main_~i~0#1 < 100000); 630#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 628#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 626#L26-3 assume !!(main_~i~0#1 < 100000); 621#L28 [2021-12-14 23:10:20,674 INFO L793 eck$LassoCheckResult]: Loop: 621#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 624#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 620#L26-3 assume !!(main_~i~0#1 < 100000); 621#L28 [2021-12-14 23:10:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 403223997, now seen corresponding path program 2 times [2021-12-14 23:10:20,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318424165] [2021-12-14 23:10:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:20,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-12-14 23:10:20,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318424165] [2021-12-14 23:10:20,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318424165] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187250667] [2021-12-14 23:10:20,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:10:20,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:20,825 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) [2021-12-14 23:10:20,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-14 23:10:20,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:10:20,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:20,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:10:20,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-12-14 23:10:20,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-12-14 23:10:21,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187250667] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:21,166 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:21,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-14 23:10:21,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171349833] [2021-12-14 23:10:21,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:21,166 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 4 times [2021-12-14 23:10:21,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425596400] [2021-12-14 23:10:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:21,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:21,188 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:21,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942523958] [2021-12-14 23:10:21,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 23:10:21,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:21,230 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) [2021-12-14 23:10:21,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-14 23:10:21,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 23:10:21,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:10:21,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:21,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:21,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 23:10:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-12-14 23:10:21,374 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. cyclomatic complexity: 16 Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:21,641 INFO L93 Difference]: Finished difference Result 249 states and 295 transitions. [2021-12-14 23:10:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 23:10:21,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 295 transitions. [2021-12-14 23:10:21,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:21,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 295 transitions. [2021-12-14 23:10:21,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2021-12-14 23:10:21,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2021-12-14 23:10:21,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 295 transitions. [2021-12-14 23:10:21,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:21,646 INFO L681 BuchiCegarLoop]: Abstraction has 249 states and 295 transitions. [2021-12-14 23:10:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 295 transitions. [2021-12-14 23:10:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 122. [2021-12-14 23:10:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 121 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2021-12-14 23:10:21,651 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2021-12-14 23:10:21,651 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2021-12-14 23:10:21,651 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:10:21,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 147 transitions. [2021-12-14 23:10:21,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:21,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:21,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:21,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 22, 21, 21, 1, 1, 1, 1] [2021-12-14 23:10:21,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:21,655 INFO L791 eck$LassoCheckResult]: Stem: 1250#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(17, 2); 1251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1244#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1245#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1246#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1247#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1345#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1343#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1341#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1339#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1337#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1335#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1333#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1331#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1329#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1327#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1325#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1323#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1321#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1319#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1317#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1315#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1311#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1309#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1307#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1303#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1301#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1299#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1297#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1295#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1293#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1291#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1289#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1287#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1285#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1283#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1281#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1279#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1277#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1275#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1273#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1271#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1269#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1267#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1266#L21-3 assume !(main_~i~0#1 < 100000); 1261#L21-4 main_~i~0#1 := 0; 1262#L26-3 assume !!(main_~i~0#1 < 100000); 1263#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1256#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1257#L26-3 assume !!(main_~i~0#1 < 100000); 1259#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1260#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1365#L26-3 assume !!(main_~i~0#1 < 100000); 1364#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1363#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1362#L26-3 assume !!(main_~i~0#1 < 100000); 1361#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1360#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1359#L26-3 assume !!(main_~i~0#1 < 100000); 1358#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1357#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1356#L26-3 assume !!(main_~i~0#1 < 100000); 1355#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1354#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1353#L26-3 assume !!(main_~i~0#1 < 100000); 1352#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1351#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1350#L26-3 assume !!(main_~i~0#1 < 100000); 1349#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1348#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1347#L26-3 assume !!(main_~i~0#1 < 100000); 1346#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1344#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1342#L26-3 assume !!(main_~i~0#1 < 100000); 1340#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1338#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1336#L26-3 assume !!(main_~i~0#1 < 100000); 1334#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1332#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1330#L26-3 assume !!(main_~i~0#1 < 100000); 1328#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1326#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1324#L26-3 assume !!(main_~i~0#1 < 100000); 1322#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1320#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1318#L26-3 assume !!(main_~i~0#1 < 100000); 1316#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1314#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1312#L26-3 assume !!(main_~i~0#1 < 100000); 1310#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1308#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1306#L26-3 assume !!(main_~i~0#1 < 100000); 1304#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1302#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1300#L26-3 assume !!(main_~i~0#1 < 100000); 1298#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1296#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1294#L26-3 assume !!(main_~i~0#1 < 100000); 1292#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1290#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1288#L26-3 assume !!(main_~i~0#1 < 100000); 1286#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1284#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1282#L26-3 assume !!(main_~i~0#1 < 100000); 1280#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1278#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1276#L26-3 assume !!(main_~i~0#1 < 100000); 1274#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 1272#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1270#L26-3 assume !!(main_~i~0#1 < 100000); 1265#L28 [2021-12-14 23:10:21,655 INFO L793 eck$LassoCheckResult]: Loop: 1265#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1268#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1264#L26-3 assume !!(main_~i~0#1 < 100000); 1265#L28 [2021-12-14 23:10:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 615339989, now seen corresponding path program 3 times [2021-12-14 23:10:21,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803834396] [2021-12-14 23:10:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:21,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2021-12-14 23:10:22,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:22,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803834396] [2021-12-14 23:10:22,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803834396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:22,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476816924] [2021-12-14 23:10:22,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:10:22,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:22,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:22,046 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) [2021-12-14 23:10:22,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-14 23:10:27,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-12-14 23:10:27,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:27,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 23:10:27,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2021-12-14 23:10:27,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2021-12-14 23:10:28,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476816924] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:28,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:28,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-12-14 23:10:28,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600766972] [2021-12-14 23:10:28,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:28,389 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 5 times [2021-12-14 23:10:28,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:28,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29208156] [2021-12-14 23:10:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:28,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:28,394 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:28,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21816048] [2021-12-14 23:10:28,394 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 23:10:28,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:28,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:28,396 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-14 23:10:28,446 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 23:10:28,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:10:28,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:28,452 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:28,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-14 23:10:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-12-14 23:10:28,522 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. cyclomatic complexity: 28 Second operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 49 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:29,234 INFO L93 Difference]: Finished difference Result 513 states and 607 transitions. [2021-12-14 23:10:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-14 23:10:29,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 607 transitions. [2021-12-14 23:10:29,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:29,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 513 states and 607 transitions. [2021-12-14 23:10:29,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 421 [2021-12-14 23:10:29,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2021-12-14 23:10:29,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 607 transitions. [2021-12-14 23:10:29,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:29,242 INFO L681 BuchiCegarLoop]: Abstraction has 513 states and 607 transitions. [2021-12-14 23:10:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 607 transitions. [2021-12-14 23:10:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 242. [2021-12-14 23:10:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.2024793388429753) internal successors, (291), 241 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2021-12-14 23:10:29,256 INFO L704 BuchiCegarLoop]: Abstraction has 242 states and 291 transitions. [2021-12-14 23:10:29,256 INFO L587 BuchiCegarLoop]: Abstraction has 242 states and 291 transitions. [2021-12-14 23:10:29,257 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:10:29,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 291 transitions. [2021-12-14 23:10:29,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:29,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:29,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:29,263 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 46, 45, 45, 1, 1, 1, 1] [2021-12-14 23:10:29,263 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:29,264 INFO L791 eck$LassoCheckResult]: Stem: 2603#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(17, 2); 2604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2597#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2598#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2599#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2600#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2794#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2792#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2790#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2788#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2786#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2784#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2782#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2780#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2778#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2776#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2774#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2772#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2770#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2768#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2766#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2764#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2762#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2760#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2758#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2756#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2754#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2752#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2750#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2748#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2746#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2744#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2742#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2740#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2738#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2736#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2734#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2732#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2730#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2728#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2726#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2724#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2722#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2720#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2718#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2716#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2714#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2712#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2710#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2708#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2706#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2704#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2702#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2700#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2698#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2696#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2694#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2692#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2690#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2688#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2686#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2684#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2682#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2680#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2678#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2676#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2674#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2672#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2670#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2668#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2666#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2664#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2662#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2660#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2658#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2656#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2654#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2652#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2650#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2648#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2646#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2644#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2642#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2640#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2638#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2636#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2634#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2632#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2630#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2628#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2626#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2624#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2622#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2620#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2619#L21-3 assume !(main_~i~0#1 < 100000); 2614#L21-4 main_~i~0#1 := 0; 2615#L26-3 assume !!(main_~i~0#1 < 100000); 2616#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2609#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2610#L26-3 assume !!(main_~i~0#1 < 100000); 2612#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2613#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2838#L26-3 assume !!(main_~i~0#1 < 100000); 2837#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2836#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2835#L26-3 assume !!(main_~i~0#1 < 100000); 2834#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2833#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2832#L26-3 assume !!(main_~i~0#1 < 100000); 2831#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2830#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2829#L26-3 assume !!(main_~i~0#1 < 100000); 2828#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2827#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2826#L26-3 assume !!(main_~i~0#1 < 100000); 2825#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2824#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2823#L26-3 assume !!(main_~i~0#1 < 100000); 2822#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2821#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2820#L26-3 assume !!(main_~i~0#1 < 100000); 2819#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2818#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2817#L26-3 assume !!(main_~i~0#1 < 100000); 2816#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2815#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2814#L26-3 assume !!(main_~i~0#1 < 100000); 2813#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2812#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2811#L26-3 assume !!(main_~i~0#1 < 100000); 2810#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2809#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2808#L26-3 assume !!(main_~i~0#1 < 100000); 2807#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2806#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2805#L26-3 assume !!(main_~i~0#1 < 100000); 2804#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2803#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2802#L26-3 assume !!(main_~i~0#1 < 100000); 2801#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2800#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2799#L26-3 assume !!(main_~i~0#1 < 100000); 2798#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2797#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2796#L26-3 assume !!(main_~i~0#1 < 100000); 2795#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2793#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2791#L26-3 assume !!(main_~i~0#1 < 100000); 2789#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2787#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2785#L26-3 assume !!(main_~i~0#1 < 100000); 2783#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2781#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2779#L26-3 assume !!(main_~i~0#1 < 100000); 2777#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2775#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2773#L26-3 assume !!(main_~i~0#1 < 100000); 2771#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2769#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2767#L26-3 assume !!(main_~i~0#1 < 100000); 2765#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2763#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2761#L26-3 assume !!(main_~i~0#1 < 100000); 2759#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2757#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2755#L26-3 assume !!(main_~i~0#1 < 100000); 2753#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2751#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2749#L26-3 assume !!(main_~i~0#1 < 100000); 2747#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2745#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2743#L26-3 assume !!(main_~i~0#1 < 100000); 2741#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2739#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2737#L26-3 assume !!(main_~i~0#1 < 100000); 2735#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2733#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2731#L26-3 assume !!(main_~i~0#1 < 100000); 2729#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2727#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2725#L26-3 assume !!(main_~i~0#1 < 100000); 2723#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2721#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2719#L26-3 assume !!(main_~i~0#1 < 100000); 2717#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2715#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2713#L26-3 assume !!(main_~i~0#1 < 100000); 2711#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2709#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2707#L26-3 assume !!(main_~i~0#1 < 100000); 2705#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2703#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2701#L26-3 assume !!(main_~i~0#1 < 100000); 2699#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2697#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2695#L26-3 assume !!(main_~i~0#1 < 100000); 2693#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2691#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2689#L26-3 assume !!(main_~i~0#1 < 100000); 2687#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2685#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2683#L26-3 assume !!(main_~i~0#1 < 100000); 2681#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2679#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2677#L26-3 assume !!(main_~i~0#1 < 100000); 2675#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2673#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2671#L26-3 assume !!(main_~i~0#1 < 100000); 2669#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2667#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2665#L26-3 assume !!(main_~i~0#1 < 100000); 2663#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2661#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2659#L26-3 assume !!(main_~i~0#1 < 100000); 2657#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2655#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2653#L26-3 assume !!(main_~i~0#1 < 100000); 2651#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2649#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2647#L26-3 assume !!(main_~i~0#1 < 100000); 2645#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2643#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2641#L26-3 assume !!(main_~i~0#1 < 100000); 2639#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2637#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2635#L26-3 assume !!(main_~i~0#1 < 100000); 2633#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2631#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2629#L26-3 assume !!(main_~i~0#1 < 100000); 2627#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 2625#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2623#L26-3 assume !!(main_~i~0#1 < 100000); 2618#L28 [2021-12-14 23:10:29,264 INFO L793 eck$LassoCheckResult]: Loop: 2618#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2621#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2617#L26-3 assume !!(main_~i~0#1 < 100000); 2618#L28 [2021-12-14 23:10:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 982432773, now seen corresponding path program 4 times [2021-12-14 23:10:29,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:29,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331730875] [2021-12-14 23:10:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:29,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2021-12-14 23:10:30,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331730875] [2021-12-14 23:10:30,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331730875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162928231] [2021-12-14 23:10:30,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 23:10:30,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:30,013 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:30,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-14 23:10:30,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 23:10:30,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:30,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-14 23:10:30,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2021-12-14 23:10:30,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2021-12-14 23:10:32,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162928231] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:32,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:32,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2021-12-14 23:10:32,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979963952] [2021-12-14 23:10:32,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:32,653 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:32,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 6 times [2021-12-14 23:10:32,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:32,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501216892] [2021-12-14 23:10:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:32,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:32,657 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 23:10:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072072960] [2021-12-14 23:10:32,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 23:10:32,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:32,659 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:32,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-14 23:10:32,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-12-14 23:10:32,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-14 23:10:32,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:32,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:32,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-12-14 23:10:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2021-12-14 23:10:32,840 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. cyclomatic complexity: 52 Second operand has 97 states, 97 states have (on average 2.020618556701031) internal successors, (196), 97 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:36,235 INFO L93 Difference]: Finished difference Result 1041 states and 1231 transitions. [2021-12-14 23:10:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-14 23:10:36,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1231 transitions. [2021-12-14 23:10:36,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:36,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1231 transitions. [2021-12-14 23:10:36,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2021-12-14 23:10:36,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2021-12-14 23:10:36,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1231 transitions. [2021-12-14 23:10:36,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:36,273 INFO L681 BuchiCegarLoop]: Abstraction has 1041 states and 1231 transitions. [2021-12-14 23:10:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1231 transitions. [2021-12-14 23:10:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 482. [2021-12-14 23:10:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.2012448132780082) internal successors, (579), 481 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 579 transitions. [2021-12-14 23:10:36,299 INFO L704 BuchiCegarLoop]: Abstraction has 482 states and 579 transitions. [2021-12-14 23:10:36,299 INFO L587 BuchiCegarLoop]: Abstraction has 482 states and 579 transitions. [2021-12-14 23:10:36,299 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:10:36,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 579 transitions. [2021-12-14 23:10:36,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:10:36,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:36,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:36,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 94, 93, 93, 1, 1, 1, 1] [2021-12-14 23:10:36,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:36,307 INFO L791 eck$LassoCheckResult]: Stem: 5372#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(17, 2); 5373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~post2#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short11#1, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 5366#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5367#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5368#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5369#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5755#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5753#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5751#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5749#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5747#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5745#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5743#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5741#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5739#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5737#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5735#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5733#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5731#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5729#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5727#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5725#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5723#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5721#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5719#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5717#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5715#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5713#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5711#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5709#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5707#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5705#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5703#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5701#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5699#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5697#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5695#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5693#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5691#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5689#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5687#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5685#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5683#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5681#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5679#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5677#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5675#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5673#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5671#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5669#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5667#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5665#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5663#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5661#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5659#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5657#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5655#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5653#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5651#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5649#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5647#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5645#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5643#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5641#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5639#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5637#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5635#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5633#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5631#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5629#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5627#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5625#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5623#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5621#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5619#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5617#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5615#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5613#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5611#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5609#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5607#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5605#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5603#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5601#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5599#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5597#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5595#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5593#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5591#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5589#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5587#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5585#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5583#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5581#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5579#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5577#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5575#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5573#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5571#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5569#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5567#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5565#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5563#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5561#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5559#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5557#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5555#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5553#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5551#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5549#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5547#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5545#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5543#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5541#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5539#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5537#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5535#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5533#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5531#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5529#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5527#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5525#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5523#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5521#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5519#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5517#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5515#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5513#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5511#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5509#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5507#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5505#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5503#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5501#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5499#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5497#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5495#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5493#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5491#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5489#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5487#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5485#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5483#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5481#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5479#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5477#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5475#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5473#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5471#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5469#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5467#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5465#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5463#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5461#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5459#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5457#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5455#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5453#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5451#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5449#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5447#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5445#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5443#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5441#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5439#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5437#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5435#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5433#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5431#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5429#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5427#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5425#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5423#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5421#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5419#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5417#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5415#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5413#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5411#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5409#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5407#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5405#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5403#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5401#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5399#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5397#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5395#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5393#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5391#L21-3 assume !!(main_~i~0#1 < 100000);call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5389#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5388#L21-3 assume !(main_~i~0#1 < 100000); 5383#L21-4 main_~i~0#1 := 0; 5384#L26-3 assume !!(main_~i~0#1 < 100000); 5385#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5378#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5379#L26-3 assume !!(main_~i~0#1 < 100000); 5381#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5382#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5847#L26-3 assume !!(main_~i~0#1 < 100000); 5846#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5845#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5844#L26-3 assume !!(main_~i~0#1 < 100000); 5843#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5842#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5841#L26-3 assume !!(main_~i~0#1 < 100000); 5840#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5839#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5838#L26-3 assume !!(main_~i~0#1 < 100000); 5837#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5836#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5835#L26-3 assume !!(main_~i~0#1 < 100000); 5834#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5833#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5832#L26-3 assume !!(main_~i~0#1 < 100000); 5831#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5830#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5829#L26-3 assume !!(main_~i~0#1 < 100000); 5828#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5827#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5826#L26-3 assume !!(main_~i~0#1 < 100000); 5825#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5824#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5823#L26-3 assume !!(main_~i~0#1 < 100000); 5822#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5821#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5820#L26-3 assume !!(main_~i~0#1 < 100000); 5819#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5818#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5817#L26-3 assume !!(main_~i~0#1 < 100000); 5816#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5815#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5814#L26-3 assume !!(main_~i~0#1 < 100000); 5813#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5812#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5811#L26-3 assume !!(main_~i~0#1 < 100000); 5810#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5809#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5808#L26-3 assume !!(main_~i~0#1 < 100000); 5807#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5806#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5805#L26-3 assume !!(main_~i~0#1 < 100000); 5804#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5803#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5802#L26-3 assume !!(main_~i~0#1 < 100000); 5801#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5800#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5799#L26-3 assume !!(main_~i~0#1 < 100000); 5798#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5797#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5796#L26-3 assume !!(main_~i~0#1 < 100000); 5795#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5794#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5793#L26-3 assume !!(main_~i~0#1 < 100000); 5792#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5791#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5790#L26-3 assume !!(main_~i~0#1 < 100000); 5789#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5788#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5787#L26-3 assume !!(main_~i~0#1 < 100000); 5786#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5785#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5784#L26-3 assume !!(main_~i~0#1 < 100000); 5783#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5782#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5781#L26-3 assume !!(main_~i~0#1 < 100000); 5780#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5779#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5778#L26-3 assume !!(main_~i~0#1 < 100000); 5777#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5776#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5775#L26-3 assume !!(main_~i~0#1 < 100000); 5774#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5773#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5772#L26-3 assume !!(main_~i~0#1 < 100000); 5771#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5770#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5769#L26-3 assume !!(main_~i~0#1 < 100000); 5768#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5767#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5766#L26-3 assume !!(main_~i~0#1 < 100000); 5765#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5764#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5763#L26-3 assume !!(main_~i~0#1 < 100000); 5762#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5761#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5760#L26-3 assume !!(main_~i~0#1 < 100000); 5759#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5758#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5757#L26-3 assume !!(main_~i~0#1 < 100000); 5756#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5754#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5752#L26-3 assume !!(main_~i~0#1 < 100000); 5750#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5748#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5746#L26-3 assume !!(main_~i~0#1 < 100000); 5744#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5742#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5740#L26-3 assume !!(main_~i~0#1 < 100000); 5738#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5736#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5734#L26-3 assume !!(main_~i~0#1 < 100000); 5732#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5730#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5728#L26-3 assume !!(main_~i~0#1 < 100000); 5726#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5724#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5722#L26-3 assume !!(main_~i~0#1 < 100000); 5720#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5718#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5716#L26-3 assume !!(main_~i~0#1 < 100000); 5714#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5712#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5710#L26-3 assume !!(main_~i~0#1 < 100000); 5708#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5706#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5704#L26-3 assume !!(main_~i~0#1 < 100000); 5702#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5700#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5698#L26-3 assume !!(main_~i~0#1 < 100000); 5696#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5694#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5692#L26-3 assume !!(main_~i~0#1 < 100000); 5690#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5688#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5686#L26-3 assume !!(main_~i~0#1 < 100000); 5684#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5682#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5680#L26-3 assume !!(main_~i~0#1 < 100000); 5678#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5676#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5674#L26-3 assume !!(main_~i~0#1 < 100000); 5672#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5670#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5668#L26-3 assume !!(main_~i~0#1 < 100000); 5666#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5664#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5662#L26-3 assume !!(main_~i~0#1 < 100000); 5660#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5658#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5656#L26-3 assume !!(main_~i~0#1 < 100000); 5654#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5652#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5650#L26-3 assume !!(main_~i~0#1 < 100000); 5648#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5646#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5644#L26-3 assume !!(main_~i~0#1 < 100000); 5642#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5640#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5638#L26-3 assume !!(main_~i~0#1 < 100000); 5636#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5634#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5632#L26-3 assume !!(main_~i~0#1 < 100000); 5630#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5628#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5626#L26-3 assume !!(main_~i~0#1 < 100000); 5624#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5622#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5620#L26-3 assume !!(main_~i~0#1 < 100000); 5618#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5616#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5614#L26-3 assume !!(main_~i~0#1 < 100000); 5612#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5610#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5608#L26-3 assume !!(main_~i~0#1 < 100000); 5606#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5604#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5602#L26-3 assume !!(main_~i~0#1 < 100000); 5600#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5598#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5596#L26-3 assume !!(main_~i~0#1 < 100000); 5594#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5592#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5590#L26-3 assume !!(main_~i~0#1 < 100000); 5588#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5586#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5584#L26-3 assume !!(main_~i~0#1 < 100000); 5582#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5580#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5578#L26-3 assume !!(main_~i~0#1 < 100000); 5576#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5574#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5572#L26-3 assume !!(main_~i~0#1 < 100000); 5570#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5568#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5566#L26-3 assume !!(main_~i~0#1 < 100000); 5564#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5562#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5560#L26-3 assume !!(main_~i~0#1 < 100000); 5558#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5556#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5554#L26-3 assume !!(main_~i~0#1 < 100000); 5552#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5550#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5548#L26-3 assume !!(main_~i~0#1 < 100000); 5546#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5544#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5542#L26-3 assume !!(main_~i~0#1 < 100000); 5540#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5538#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5536#L26-3 assume !!(main_~i~0#1 < 100000); 5534#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5532#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5530#L26-3 assume !!(main_~i~0#1 < 100000); 5528#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5526#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5524#L26-3 assume !!(main_~i~0#1 < 100000); 5522#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5520#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5518#L26-3 assume !!(main_~i~0#1 < 100000); 5516#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5514#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5512#L26-3 assume !!(main_~i~0#1 < 100000); 5510#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5508#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5506#L26-3 assume !!(main_~i~0#1 < 100000); 5504#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5502#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5500#L26-3 assume !!(main_~i~0#1 < 100000); 5498#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5496#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5494#L26-3 assume !!(main_~i~0#1 < 100000); 5492#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5490#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5488#L26-3 assume !!(main_~i~0#1 < 100000); 5486#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5484#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5482#L26-3 assume !!(main_~i~0#1 < 100000); 5480#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5478#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5476#L26-3 assume !!(main_~i~0#1 < 100000); 5474#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5472#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5470#L26-3 assume !!(main_~i~0#1 < 100000); 5468#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5466#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5464#L26-3 assume !!(main_~i~0#1 < 100000); 5462#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5460#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5458#L26-3 assume !!(main_~i~0#1 < 100000); 5456#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5454#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5452#L26-3 assume !!(main_~i~0#1 < 100000); 5450#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5448#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5446#L26-3 assume !!(main_~i~0#1 < 100000); 5444#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5442#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5440#L26-3 assume !!(main_~i~0#1 < 100000); 5438#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5436#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5434#L26-3 assume !!(main_~i~0#1 < 100000); 5432#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5430#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5428#L26-3 assume !!(main_~i~0#1 < 100000); 5426#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5424#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5422#L26-3 assume !!(main_~i~0#1 < 100000); 5420#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5418#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5416#L26-3 assume !!(main_~i~0#1 < 100000); 5414#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5412#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5410#L26-3 assume !!(main_~i~0#1 < 100000); 5408#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5406#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5404#L26-3 assume !!(main_~i~0#1 < 100000); 5402#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5400#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5398#L26-3 assume !!(main_~i~0#1 < 100000); 5396#L28 assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; 5394#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5392#L26-3 assume !!(main_~i~0#1 < 100000); 5387#L28 [2021-12-14 23:10:36,307 INFO L793 eck$LassoCheckResult]: Loop: 5387#L28 assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call write~int(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5390#L26-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5386#L26-3 assume !!(main_~i~0#1 < 100000); 5387#L28 [2021-12-14 23:10:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1696203877, now seen corresponding path program 5 times [2021-12-14 23:10:36,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967937244] [2021-12-14 23:10:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:36,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21763 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 12927 trivial. 0 not checked. [2021-12-14 23:10:39,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:39,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967937244] [2021-12-14 23:10:39,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967937244] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264670072] [2021-12-14 23:10:39,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 23:10:39,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:39,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:39,320 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:39,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process