./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 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/termination-restricted-15/NarrowKonv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2c8d79b985e49ac5d6f27b4e25f4e3597dadc4ec57e262caec7782b796e874b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 03:09:03,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 03:09:03,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 03:09:03,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 03:09:03,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 03:09:03,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 03:09:03,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 03:09:03,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 03:09:03,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 03:09:03,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 03:09:03,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 03:09:03,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 03:09:03,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 03:09:03,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 03:09:03,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 03:09:03,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 03:09:03,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 03:09:03,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 03:09:03,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 03:09:03,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 03:09:03,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 03:09:03,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 03:09:03,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 03:09:03,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 03:09:03,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 03:09:03,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 03:09:03,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 03:09:03,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 03:09:03,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 03:09:03,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 03:09:03,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 03:09:03,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 03:09:03,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 03:09:03,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 03:09:03,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 03:09:03,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 03:09:03,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 03:09:03,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 03:09:03,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 03:09:03,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 03:09:03,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 03:09:03,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 03:09:03,571 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 03:09:03,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 03:09:03,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 03:09:03,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 03:09:03,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 03:09:03,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 03:09:03,573 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 03:09:03,573 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 03:09:03,574 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 03:09:03,574 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 03:09:03,574 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 03:09:03,574 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 03:09:03,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 03:09:03,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 03:09:03,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 03:09:03,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 03:09:03,576 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 03:09:03,576 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 03:09:03,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 03:09:03,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 03:09:03,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 03:09:03,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 03:09:03,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 03:09:03,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 03:09:03,578 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c8d79b985e49ac5d6f27b4e25f4e3597dadc4ec57e262caec7782b796e874b7 [2023-02-14 03:09:03,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 03:09:03,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 03:09:03,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 03:09:03,791 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 03:09:03,792 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 03:09:03,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2023-02-14 03:09:04,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 03:09:05,081 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 03:09:05,081 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2023-02-14 03:09:05,086 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459e3d255/1e80c67997024d14a4a424919079b9ee/FLAG4ce5ad125 [2023-02-14 03:09:05,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459e3d255/1e80c67997024d14a4a424919079b9ee [2023-02-14 03:09:05,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 03:09:05,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 03:09:05,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 03:09:05,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 03:09:05,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 03:09:05,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3605e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05, skipping insertion in model container [2023-02-14 03:09:05,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 03:09:05,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 03:09:05,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:09:05,220 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 03:09:05,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:09:05,238 INFO L208 MainTranslator]: Completed translation [2023-02-14 03:09:05,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05 WrapperNode [2023-02-14 03:09:05,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 03:09:05,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 03:09:05,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 03:09:05,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 03:09:05,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,262 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-02-14 03:09:05,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 03:09:05,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 03:09:05,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 03:09:05,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 03:09:05,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 03:09:05,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 03:09:05,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 03:09:05,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 03:09:05,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (1/1) ... [2023-02-14 03:09:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:05,303 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) [2023-02-14 03:09:05,307 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 [2023-02-14 03:09:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 03:09:05,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 03:09:05,414 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 03:09:05,416 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 03:09:05,468 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 03:09:05,472 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 03:09:05,473 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 03:09:05,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:05 BoogieIcfgContainer [2023-02-14 03:09:05,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 03:09:05,475 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 03:09:05,475 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 03:09:05,477 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 03:09:05,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:05,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 03:09:05" (1/3) ... [2023-02-14 03:09:05,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@677c7021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:09:05, skipping insertion in model container [2023-02-14 03:09:05,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:05,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:09:05" (2/3) ... [2023-02-14 03:09:05,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@677c7021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:09:05, skipping insertion in model container [2023-02-14 03:09:05,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:09:05,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:05" (3/3) ... [2023-02-14 03:09:05,481 INFO L332 chiAutomizerObserver]: Analyzing ICFG NarrowKonv.c [2023-02-14 03:09:05,516 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 03:09:05,517 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 03:09:05,517 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 03:09:05,517 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 03:09:05,517 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 03:09:05,517 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 03:09:05,517 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 03:09:05,518 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 03:09:05,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:05,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:09:05,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:05,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:05,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 03:09:05,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:05,540 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 03:09:05,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:05,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:09:05,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:05,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:05,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 03:09:05,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:05,548 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 3#L12-1true [2023-02-14 03:09:05,549 INFO L750 eck$LassoCheckResult]: Loop: 3#L12-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9#L12true assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3#L12-1true [2023-02-14 03:09:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-14 03:09:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786953382] [2023-02-14 03:09:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 1 times [2023-02-14 03:09:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914466981] [2023-02-14 03:09:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 925806, now seen corresponding path program 1 times [2023-02-14 03:09:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479777987] [2023-02-14 03:09:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:05,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479777987] [2023-02-14 03:09:05,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479777987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:05,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:05,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 03:09:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817074457] [2023-02-14 03:09:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 03:09:05,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 03:09:05,760 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) 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) [2023-02-14 03:09:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:05,779 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-02-14 03:09:05,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2023-02-14 03:09:05,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:05,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 8 states and 11 transitions. [2023-02-14 03:09:05,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-14 03:09:05,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-14 03:09:05,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-14 03:09:05,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:09:05,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-14 03:09:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-14 03:09:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-14 03:09:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-14 03:09:05,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-14 03:09:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 03:09:05,805 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-14 03:09:05,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 03:09:05,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2023-02-14 03:09:05,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:05,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:05,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:05,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-14 03:09:05,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:09:05,807 INFO L748 eck$LassoCheckResult]: Stem: 39#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 41#L12-1 [2023-02-14 03:09:05,807 INFO L750 eck$LassoCheckResult]: Loop: 41#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 42#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 43#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 41#L12-1 [2023-02-14 03:09:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-14 03:09:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151518607] [2023-02-14 03:09:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 1 times [2023-02-14 03:09:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054744479] [2023-02-14 03:09:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 28699757, now seen corresponding path program 1 times [2023-02-14 03:09:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22174622] [2023-02-14 03:09:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:05,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:05,892 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:05,893 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:05,893 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:05,893 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:05,893 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:05,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:05,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:05,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:05,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-14 03:09:05,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:05,894 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:05,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:05,924 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:05,960 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,025 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:06,026 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,045 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) [2023-02-14 03:09:06,047 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 [2023-02-14 03:09:06,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:06,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:06,075 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:06,075 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:06,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,084 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) [2023-02-14 03:09:06,087 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 [2023-02-14 03:09:06,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:06,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:06,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:06,112 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:06,118 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 [2023-02-14 03:09:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,134 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) [2023-02-14 03:09:06,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:06,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:06,173 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 [2023-02-14 03:09:06,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-14 03:09:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,191 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) [2023-02-14 03:09:06,193 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 [2023-02-14 03:09:06,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:06,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:06,232 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:06,239 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 [2023-02-14 03:09:06,240 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:06,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:06,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:06,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:06,240 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:06,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:06,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:06,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-14 03:09:06,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:06,240 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:06,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,247 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,254 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,324 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:06,328 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,342 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) [2023-02-14 03:09:06,343 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 [2023-02-14 03:09:06,345 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 [2023-02-14 03:09:06,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:06,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:06,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:06,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:06,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:06,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:06,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:06,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-14 03:09:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,391 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) [2023-02-14 03:09:06,393 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 [2023-02-14 03:09:06,397 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 [2023-02-14 03:09:06,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:06,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:06,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:06,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:06,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:06,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:06,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:06,446 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 [2023-02-14 03:09:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,449 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) [2023-02-14 03:09:06,452 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 [2023-02-14 03:09:06,454 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 [2023-02-14 03:09:06,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:06,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:06,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:06,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:06,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:06,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:06,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:06,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:06,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:09:06,491 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:06,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,503 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) [2023-02-14 03:09:06,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:06,506 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:06,506 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:06,507 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-14 03:09:06,508 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 [2023-02-14 03:09:06,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-14 03:09:06,514 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:06,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:06,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:06,592 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:09:06,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:06,616 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 03:09:06,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:06,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 15 transitions. Complement of second has 5 states. [2023-02-14 03:09:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-14 03:09:06,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2023-02-14 03:09:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2023-02-14 03:09:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-14 03:09:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:06,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2023-02-14 03:09:06,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:09:06,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2023-02-14 03:09:06,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-14 03:09:06,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-14 03:09:06,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2023-02-14 03:09:06,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:06,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-14 03:09:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2023-02-14 03:09:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-14 03:09:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-02-14 03:09:06,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-14 03:09:06,650 INFO L428 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-14 03:09:06,650 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 03:09:06,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2023-02-14 03:09:06,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:09:06,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:06,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:06,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:09:06,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:06,652 INFO L748 eck$LassoCheckResult]: Stem: 97#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 99#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 93#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 95#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 90#L12-1 [2023-02-14 03:09:06,653 INFO L750 eck$LassoCheckResult]: Loop: 90#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 91#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 90#L12-1 [2023-02-14 03:09:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 28699755, now seen corresponding path program 1 times [2023-02-14 03:09:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331334276] [2023-02-14 03:09:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 2 times [2023-02-14 03:09:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953238218] [2023-02-14 03:09:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1810661142, now seen corresponding path program 1 times [2023-02-14 03:09:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948908915] [2023-02-14 03:09:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:06,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948908915] [2023-02-14 03:09:06,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948908915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:06,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136554161] [2023-02-14 03:09:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:06,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 03:09:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:06,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 03:09:06,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:06,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:06,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136554161] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:06,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:06,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-02-14 03:09:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265827646] [2023-02-14 03:09:06,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 03:09:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-14 03:09:06,797 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:06,827 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-14 03:09:06,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2023-02-14 03:09:06,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:06,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2023-02-14 03:09:06,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-14 03:09:06,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-14 03:09:06,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2023-02-14 03:09:06,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:06,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-14 03:09:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2023-02-14 03:09:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 03:09:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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) [2023-02-14 03:09:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-02-14 03:09:06,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-14 03:09:06,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 03:09:06,832 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-14 03:09:06,832 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 03:09:06,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2023-02-14 03:09:06,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:06,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:06,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:06,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2023-02-14 03:09:06,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:09:06,834 INFO L748 eck$LassoCheckResult]: Stem: 182#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 184#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 177#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 185#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 174#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 175#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 179#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 180#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 196#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 195#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 188#L12-1 [2023-02-14 03:09:06,834 INFO L750 eck$LassoCheckResult]: Loop: 188#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 193#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 186#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 188#L12-1 [2023-02-14 03:09:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1805445589, now seen corresponding path program 1 times [2023-02-14 03:09:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703338891] [2023-02-14 03:09:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 2 times [2023-02-14 03:09:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100001452] [2023-02-14 03:09:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -154083067, now seen corresponding path program 2 times [2023-02-14 03:09:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652276610] [2023-02-14 03:09:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,885 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:06,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:06,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:06,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:06,886 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:06,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:06,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:06,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-14 03:09:06,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:06,887 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:06,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:06,932 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:06,933 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:06,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,936 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) [2023-02-14 03:09:06,937 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 [2023-02-14 03:09:06,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:06,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:06,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:06,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:06,977 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 [2023-02-14 03:09:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,980 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) [2023-02-14 03:09:07,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:07,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,017 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 [2023-02-14 03:09:07,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:07,024 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:07,029 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 [2023-02-14 03:09:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,030 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) [2023-02-14 03:09:07,033 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 [2023-02-14 03:09:07,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:07,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,062 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 [2023-02-14 03:09:07,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,064 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) [2023-02-14 03:09:07,066 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 [2023-02-14 03:09:07,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:07,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,129 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:07,133 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 [2023-02-14 03:09:07,134 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:07,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:07,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:07,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:07,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:07,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:07,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:07,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-14 03:09:07,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:07,134 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:07,135 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,221 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:07,221 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,224 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) [2023-02-14 03:09:07,239 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 [2023-02-14 03:09:07,239 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 [2023-02-14 03:09:07,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:07,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:07,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:07,285 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 [2023-02-14 03:09:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,287 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) [2023-02-14 03:09:07,303 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 [2023-02-14 03:09:07,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:07,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:07,316 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 [2023-02-14 03:09:07,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:07,326 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 [2023-02-14 03:09:07,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,328 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) [2023-02-14 03:09:07,331 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 [2023-02-14 03:09:07,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:09:07,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:07,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:07,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:07,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:07,374 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:09:07,375 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,398 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) [2023-02-14 03:09:07,401 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 [2023-02-14 03:09:07,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:07,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:07,402 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:07,402 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-14 03:09:07,407 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 [2023-02-14 03:09:07,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:07,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:07,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:07,447 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:09:07,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:07,463 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 03:09:07,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:07,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 50 transitions. Complement of second has 5 states. [2023-02-14 03:09:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-14 03:09:07,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-14 03:09:07,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:07,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 03:09:07,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:07,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 03:09:07,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:07,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2023-02-14 03:09:07,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:07,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 44 transitions. [2023-02-14 03:09:07,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-14 03:09:07,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-14 03:09:07,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2023-02-14 03:09:07,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:07,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-14 03:09:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2023-02-14 03:09:07,513 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 [2023-02-14 03:09:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-02-14 03:09:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-02-14 03:09:07,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-14 03:09:07,519 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-14 03:09:07,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 03:09:07,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2023-02-14 03:09:07,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:09:07,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:07,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:07,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1] [2023-02-14 03:09:07,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:09:07,521 INFO L748 eck$LassoCheckResult]: Stem: 311#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 312#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 313#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 307#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 305#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 306#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 322#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 303#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 304#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 308#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 309#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 335#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 333#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 325#L12-1 [2023-02-14 03:09:07,521 INFO L750 eck$LassoCheckResult]: Loop: 325#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 331#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 323#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 325#L12-1 [2023-02-14 03:09:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1972849857, now seen corresponding path program 3 times [2023-02-14 03:09:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:07,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803691404] [2023-02-14 03:09:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,528 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 [2023-02-14 03:09:07,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 3 times [2023-02-14 03:09:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225590302] [2023-02-14 03:09:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 837622447, now seen corresponding path program 4 times [2023-02-14 03:09:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:07,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333400066] [2023-02-14 03:09:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:07,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:07,581 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:07,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:07,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:07,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:07,581 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:07,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:07,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:07,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-14 03:09:07,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:07,582 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:07,583 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,585 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:07,624 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:07,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,639 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:07,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:07,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-14 03:09:07,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:07,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:07,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-02-14 03:09:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,672 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:09:07,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-14 03:09:07,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:07,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:09:07,687 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:09:07,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,693 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2023-02-14 03:09:07,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-14 03:09:07,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:07,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:07,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,732 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2023-02-14 03:09:07,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:07,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-14 03:09:07,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:07,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:07,775 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:07,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:07,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:07,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:07,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:07,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:07,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:07,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-14 03:09:07,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:07,776 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:07,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,781 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,783 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:07,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:07,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:07,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,850 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2023-02-14 03:09:07,860 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 [2023-02-14 03:09:07,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:07,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:07,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-14 03:09:07,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:07,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:07,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,913 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2023-02-14 03:09:07,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-14 03:09:07,931 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 [2023-02-14 03:09:07,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:09:07,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:09:07,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:09:07,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,958 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2023-02-14 03:09:07,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-14 03:09:07,969 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 [2023-02-14 03:09:07,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:07,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:07,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:07,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:07,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:07,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:07,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:07,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:07,993 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:09:07,994 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:07,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:07,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:07,995 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2023-02-14 03:09:08,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:08,013 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:08,013 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:08,013 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-14 03:09:08,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-14 03:09:08,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:08,020 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,053 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,063 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 03:09:08,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 51 transitions. Complement of second has 5 states. [2023-02-14 03:09:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-14 03:09:08,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 03:09:08,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:08,079 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,119 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,130 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 03:09:08,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,138 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 51 transitions. Complement of second has 5 states. [2023-02-14 03:09:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-14 03:09:08,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 03:09:08,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:08,140 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,170 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,185 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 03:09:08,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 69 transitions. Complement of second has 4 states. [2023-02-14 03:09:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-02-14 03:09:08,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 03:09:08,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:08,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 17 letters. Loop has 3 letters. [2023-02-14 03:09:08,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:08,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 6 letters. [2023-02-14 03:09:08,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:08,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2023-02-14 03:09:08,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-14 03:09:08,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 58 transitions. [2023-02-14 03:09:08,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-14 03:09:08,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-14 03:09:08,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2023-02-14 03:09:08,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:08,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-02-14 03:09:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2023-02-14 03:09:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-14 03:09:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-02-14 03:09:08,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-14 03:09:08,218 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-14 03:09:08,218 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 03:09:08,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2023-02-14 03:09:08,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-14 03:09:08,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:08,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:08,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1] [2023-02-14 03:09:08,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2023-02-14 03:09:08,219 INFO L748 eck$LassoCheckResult]: Stem: 673#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 675#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 667#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 694#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 665#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 669#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 670#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 676#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 671#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 672#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 692#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 686#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 685#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 682#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 680#L12-1 [2023-02-14 03:09:08,219 INFO L750 eck$LassoCheckResult]: Loop: 680#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 681#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 690#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 688#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 689#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 687#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 680#L12-1 [2023-02-14 03:09:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1031341869, now seen corresponding path program 5 times [2023-02-14 03:09:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:08,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859456590] [2023-02-14 03:09:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:08,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859456590] [2023-02-14 03:09:08,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859456590] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:08,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42010435] [2023-02-14 03:09:08,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:09:08,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,365 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) [2023-02-14 03:09:08,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-14 03:09:08,411 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-02-14 03:09:08,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:08,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:08,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42010435] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:08,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:08,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-14 03:09:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626981127] [2023-02-14 03:09:08,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:08,511 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1215871107, now seen corresponding path program 1 times [2023-02-14 03:09:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597689104] [2023-02-14 03:09:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:08,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:08,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:08,557 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:08,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:08,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:08,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:08,558 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:08,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:08,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:08,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-14 03:09:08,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:08,558 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:08,559 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,567 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,569 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:08,635 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:08,635 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,649 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2023-02-14 03:09:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-14 03:09:08,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:08,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:08,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,739 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2023-02-14 03:09:08,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:08,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:08,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-14 03:09:08,830 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:08,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:08,834 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:08,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:08,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:08,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:08,835 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:08,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,835 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:08,835 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:08,835 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-14 03:09:08,835 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:08,835 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:08,836 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,853 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,858 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:08,900 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:08,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:08,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,917 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2023-02-14 03:09:08,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-14 03:09:08,921 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 [2023-02-14 03:09:08,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:08,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:08,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:08,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:08,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:08,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:08,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:08,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:08,934 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,935 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-02-14 03:09:08,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-14 03:09:08,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:08,938 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:08,938 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:08,938 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-14 03:09:08,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:08,968 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:08,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:08,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:09,038 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 03:09:09,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 67 transitions. Complement of second has 7 states. [2023-02-14 03:09:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2023-02-14 03:09:09,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-14 03:09:09,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,054 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:09,118 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 03:09:09,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,138 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 70 transitions. Complement of second has 9 states. [2023-02-14 03:09:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2023-02-14 03:09:09,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-14 03:09:09,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,141 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:09,200 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 03:09:09,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,213 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 94 transitions. Complement of second has 6 states. [2023-02-14 03:09:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-14 03:09:09,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-14 03:09:09,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,215 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:09,277 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 03:09:09,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,306 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 94 transitions. Complement of second has 10 states. [2023-02-14 03:09:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2023-02-14 03:09:09,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-14 03:09:09,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 23 letters. Loop has 6 letters. [2023-02-14 03:09:09,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 17 letters. Loop has 12 letters. [2023-02-14 03:09:09,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:09,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 94 transitions. [2023-02-14 03:09:09,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2023-02-14 03:09:09,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 53 states and 69 transitions. [2023-02-14 03:09:09,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-14 03:09:09,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-14 03:09:09,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2023-02-14 03:09:09,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:09,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 69 transitions. [2023-02-14 03:09:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2023-02-14 03:09:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-02-14 03:09:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-02-14 03:09:09,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-02-14 03:09:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 03:09:09,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-02-14 03:09:09,314 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:09,368 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2023-02-14 03:09:09,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 90 transitions. [2023-02-14 03:09:09,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-14 03:09:09,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 61 states and 74 transitions. [2023-02-14 03:09:09,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-02-14 03:09:09,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-02-14 03:09:09,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2023-02-14 03:09:09,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:09,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 74 transitions. [2023-02-14 03:09:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2023-02-14 03:09:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-02-14 03:09:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-02-14 03:09:09,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-02-14 03:09:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 03:09:09,373 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-02-14 03:09:09,373 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 03:09:09,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 71 transitions. [2023-02-14 03:09:09,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-14 03:09:09,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:09,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:09,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 9, 2, 1, 1] [2023-02-14 03:09:09,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2023-02-14 03:09:09,375 INFO L748 eck$LassoCheckResult]: Stem: 1529#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 1531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1550#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1549#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1547#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1544#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1579#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1578#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1577#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1576#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1575#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1574#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1573#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1570#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1569#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1556#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1566#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1564#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1563#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1562#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1561#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1559#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1558#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1557#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1540#L12 [2023-02-14 03:09:09,375 INFO L750 eck$LassoCheckResult]: Loop: 1540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1551#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1546#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1548#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1536#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1540#L12 [2023-02-14 03:09:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -566648130, now seen corresponding path program 6 times [2023-02-14 03:09:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717387746] [2023-02-14 03:09:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 03:09:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717387746] [2023-02-14 03:09:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717387746] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745594877] [2023-02-14 03:09:09,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:09:09,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:09,475 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:09,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-14 03:09:09,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-14 03:09:09,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:09,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 03:09:09,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 03:09:09,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745594877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:09,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:09,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-14 03:09:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514531353] [2023-02-14 03:09:09,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:09,728 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1423235079, now seen corresponding path program 2 times [2023-02-14 03:09:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:09,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525293518] [2023-02-14 03:09:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:09,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:09,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:09,773 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:09,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:09,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:09,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:09,774 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:09:09,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:09,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:09,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:09,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration7_Loop [2023-02-14 03:09:09,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:09,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:09,775 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:09,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:09,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:09,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:09,810 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:09:09,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:09,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:09,811 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-02-14 03:09:09,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-14 03:09:09,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:09:09,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:09,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:09,869 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-02-14 03:09:09,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-14 03:09:09,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:09:09,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:09:09,957 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:09:09,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:09,977 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:09:09,977 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:09:09,977 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:09:09,977 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:09:09,977 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:09:09,977 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:09,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:09:09,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:09:09,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration7_Loop [2023-02-14 03:09:09,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:09:09,977 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:09:09,978 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:09,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:09,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:09:10,018 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:09:10,018 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:09:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:10,027 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2023-02-14 03:09:10,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-14 03:09:10,029 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 [2023-02-14 03:09:10,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:09:10,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:09:10,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:09:10,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:09:10,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:09:10,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:09:10,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:09:10,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:09:10,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:09:10,052 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:09:10,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:09:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:10,055 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2023-02-14 03:09:10,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-14 03:09:10,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:09:10,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:09:10,057 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:09:10,057 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1) = 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-14 03:09:10,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:10,063 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:09:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:10,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:09:10,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:10,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:09:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 03:09:10,165 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-14 03:09:10,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:10,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 120 states and 152 transitions. Complement of second has 6 states. [2023-02-14 03:09:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2023-02-14 03:09:10,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-14 03:09:10,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:10,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 45 letters. Loop has 9 letters. [2023-02-14 03:09:10,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:10,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 18 letters. [2023-02-14 03:09:10,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:10,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 152 transitions. [2023-02-14 03:09:10,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:10,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 82 states and 105 transitions. [2023-02-14 03:09:10,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-14 03:09:10,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-14 03:09:10,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 105 transitions. [2023-02-14 03:09:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:10,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-02-14 03:09:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 105 transitions. [2023-02-14 03:09:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2023-02-14 03:09:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 65 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-02-14 03:09:10,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-02-14 03:09:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 03:09:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=356, Unknown=0, NotChecked=0, Total=600 [2023-02-14 03:09:10,193 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:10,334 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2023-02-14 03:09:10,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 172 transitions. [2023-02-14 03:09:10,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:10,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 118 states and 136 transitions. [2023-02-14 03:09:10,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-14 03:09:10,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-14 03:09:10,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 136 transitions. [2023-02-14 03:09:10,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:10,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 136 transitions. [2023-02-14 03:09:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 136 transitions. [2023-02-14 03:09:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-02-14 03:09:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2023-02-14 03:09:10,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 132 transitions. [2023-02-14 03:09:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 03:09:10,341 INFO L428 stractBuchiCegarLoop]: Abstraction has 114 states and 132 transitions. [2023-02-14 03:09:10,341 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-14 03:09:10,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 132 transitions. [2023-02-14 03:09:10,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:10,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:10,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:10,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 23, 21, 2, 1, 1] [2023-02-14 03:09:10,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:10,344 INFO L748 eck$LassoCheckResult]: Stem: 2330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 2332#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2333#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2334#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2438#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2335#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2329#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2327#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2328#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2437#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2436#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2435#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2434#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2433#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2432#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2431#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2430#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2429#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2428#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2427#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2426#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2425#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2424#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2423#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2422#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2421#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2420#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2419#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2418#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2417#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2416#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2415#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2414#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2413#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2412#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2411#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2410#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2409#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2408#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2407#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2406#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2405#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2404#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2403#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2386#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2387#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2385#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2384#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2383#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2382#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2380#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2381#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2402#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2401#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2400#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2399#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2398#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2397#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2396#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2395#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2394#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2393#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2392#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2391#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2390#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2389#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2388#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2362#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2349#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2346#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2344#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2326#L12 [2023-02-14 03:09:10,344 INFO L750 eck$LassoCheckResult]: Loop: 2326#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2325#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2326#L12 [2023-02-14 03:09:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1262893886, now seen corresponding path program 7 times [2023-02-14 03:09:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:10,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886751704] [2023-02-14 03:09:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:10,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-14 03:09:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-14 03:09:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886751704] [2023-02-14 03:09:10,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886751704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062484015] [2023-02-14 03:09:10,618 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 03:09:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:10,620 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:10,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-02-14 03:09:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:10,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 03:09:10,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-14 03:09:11,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-14 03:09:11,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062484015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:11,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:11,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 38 [2023-02-14 03:09:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550050049] [2023-02-14 03:09:11,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:11,299 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1654, now seen corresponding path program 3 times [2023-02-14 03:09:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54194242] [2023-02-14 03:09:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-14 03:09:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2023-02-14 03:09:11,317 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. cyclomatic complexity: 24 Second operand has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:11,469 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2023-02-14 03:09:11,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 249 transitions. [2023-02-14 03:09:11,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:11,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 181 states and 199 transitions. [2023-02-14 03:09:11,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-14 03:09:11,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-14 03:09:11,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 199 transitions. [2023-02-14 03:09:11,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:11,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 199 transitions. [2023-02-14 03:09:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 199 transitions. [2023-02-14 03:09:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2023-02-14 03:09:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.1016949152542372) internal successors, (195), 176 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2023-02-14 03:09:11,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 195 transitions. [2023-02-14 03:09:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-14 03:09:11,477 INFO L428 stractBuchiCegarLoop]: Abstraction has 177 states and 195 transitions. [2023-02-14 03:09:11,477 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-14 03:09:11,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 195 transitions. [2023-02-14 03:09:11,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:11,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:11,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:11,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 36, 34, 2, 1, 1] [2023-02-14 03:09:11,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:11,480 INFO L748 eck$LassoCheckResult]: Stem: 3150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 3152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3153#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3154#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 3321#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3155#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3149#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3147#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3320#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3319#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3318#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3317#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3316#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3315#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3314#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3313#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3312#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3311#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3310#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3309#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3308#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3307#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3306#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3305#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3304#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3303#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3302#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3301#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3300#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3299#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3298#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3297#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3296#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3295#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3294#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3293#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3292#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3291#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3290#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3289#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3288#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3287#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3286#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3285#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3284#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3283#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3282#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3281#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3280#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3279#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3278#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3277#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3276#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3275#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3274#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3273#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3272#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3271#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3230#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3231#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3229#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3228#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3227#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 3226#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3224#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3225#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3270#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3269#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3268#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3267#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3266#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3265#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3264#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3263#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3262#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3261#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3260#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3259#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3258#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3257#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3256#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3255#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3254#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3253#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3252#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3251#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3250#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3249#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3248#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3247#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3246#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3245#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3244#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3243#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3242#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3241#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3240#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3239#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3238#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3237#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3236#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3235#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3234#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3233#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3232#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3182#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3169#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3166#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3146#L12 [2023-02-14 03:09:11,480 INFO L750 eck$LassoCheckResult]: Loop: 3146#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3145#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3146#L12 [2023-02-14 03:09:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1287581916, now seen corresponding path program 8 times [2023-02-14 03:09:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436838316] [2023-02-14 03:09:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1654, now seen corresponding path program 4 times [2023-02-14 03:09:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801432946] [2023-02-14 03:09:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -415639335, now seen corresponding path program 1 times [2023-02-14 03:09:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812452785] [2023-02-14 03:09:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2023-02-14 03:09:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812452785] [2023-02-14 03:09:11,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812452785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:09:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:09:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 03:09:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493625928] [2023-02-14 03:09:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:09:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 03:09:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 03:09:11,596 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:11,611 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2023-02-14 03:09:11,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 199 transitions. [2023-02-14 03:09:11,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:11,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 135 states and 146 transitions. [2023-02-14 03:09:11,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-14 03:09:11,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-02-14 03:09:11,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 146 transitions. [2023-02-14 03:09:11,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:11,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 146 transitions. [2023-02-14 03:09:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 146 transitions. [2023-02-14 03:09:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2023-02-14 03:09:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.078740157480315) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-14 03:09:11,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-14 03:09:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 03:09:11,619 INFO L428 stractBuchiCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-14 03:09:11,620 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-14 03:09:11,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 137 transitions. [2023-02-14 03:09:11,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:11,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:11,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:11,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [38, 37, 34, 3, 1, 1, 1] [2023-02-14 03:09:11,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:11,622 INFO L748 eck$LassoCheckResult]: Stem: 3521#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 3515#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3516#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3520#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 3518#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3519#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3523#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3641#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3640#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3639#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3638#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3637#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3636#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3635#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3634#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3633#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3632#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3631#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3630#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3629#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3628#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3627#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3626#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3625#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3624#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3623#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3622#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3621#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3620#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3619#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3618#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3617#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3616#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3615#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3614#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3613#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3612#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3611#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3610#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3609#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3608#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3607#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3606#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3605#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3604#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3603#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3602#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3601#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3600#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3599#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3598#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3597#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3596#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3595#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3594#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3593#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3592#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3591#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3590#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3588#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3589#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3587#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3586#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3585#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 3584#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3583#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3582#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3581#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3580#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3579#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3578#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3577#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3576#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3575#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3574#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3573#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3570#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3569#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3568#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3567#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3566#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3565#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3564#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3563#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3562#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3561#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3560#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3559#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3558#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3557#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3556#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3554#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3553#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3552#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3551#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3550#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3549#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3548#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3547#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3546#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3545#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3544#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3542#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3543#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3534#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 3535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3532#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3528#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 3529#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3526#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3525#L12-1 [2023-02-14 03:09:11,622 INFO L750 eck$LassoCheckResult]: Loop: 3525#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3524#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3525#L12-1 [2023-02-14 03:09:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2325394, now seen corresponding path program 2 times [2023-02-14 03:09:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995587064] [2023-02-14 03:09:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-02-14 03:09:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995587064] [2023-02-14 03:09:11,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995587064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532533375] [2023-02-14 03:09:11,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:09:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:11,921 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:11,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-02-14 03:09:11,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:09:11,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:11,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 03:09:11,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-02-14 03:09:12,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-02-14 03:09:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532533375] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:12,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2023-02-14 03:09:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729666998] [2023-02-14 03:09:12,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:12,602 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 5 times [2023-02-14 03:09:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:12,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145591411] [2023-02-14 03:09:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:12,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:12,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 03:09:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1004, Unknown=0, NotChecked=0, Total=1560 [2023-02-14 03:09:12,616 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. cyclomatic complexity: 15 Second operand has 40 states, 40 states have (on average 3.075) internal successors, (123), 40 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:13,377 INFO L93 Difference]: Finished difference Result 395 states and 407 transitions. [2023-02-14 03:09:13,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 407 transitions. [2023-02-14 03:09:13,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:13,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 249 states and 261 transitions. [2023-02-14 03:09:13,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-14 03:09:13,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-14 03:09:13,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 261 transitions. [2023-02-14 03:09:13,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:13,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 261 transitions. [2023-02-14 03:09:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 261 transitions. [2023-02-14 03:09:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2023-02-14 03:09:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 241 states have (on average 1.049792531120332) internal successors, (253), 240 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 253 transitions. [2023-02-14 03:09:13,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 253 transitions. [2023-02-14 03:09:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-02-14 03:09:13,384 INFO L428 stractBuchiCegarLoop]: Abstraction has 241 states and 253 transitions. [2023-02-14 03:09:13,385 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-14 03:09:13,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 253 transitions. [2023-02-14 03:09:13,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:13,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:13,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:13,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [76, 75, 70, 5, 1, 1, 1] [2023-02-14 03:09:13,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:13,388 INFO L748 eck$LassoCheckResult]: Stem: 4845#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 4847#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4848#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4844#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4842#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4843#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4849#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5080#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5079#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5078#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5077#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5076#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5075#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5074#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5073#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5072#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5071#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5070#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5069#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5068#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5067#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5066#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5065#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5064#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5063#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5062#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5061#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5060#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5059#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5058#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5057#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5056#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5055#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5054#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5053#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5052#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5051#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5050#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5049#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5048#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5047#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5046#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5045#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5044#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5043#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5042#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5041#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5040#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5039#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5038#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5037#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5036#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5035#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5034#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5033#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5032#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5031#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5030#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5029#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5028#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5026#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5025#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5024#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 5023#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5022#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5021#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5020#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5019#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5018#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5017#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5016#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5015#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5014#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5013#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5012#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5011#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5010#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5009#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5008#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5007#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5006#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5005#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5004#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5003#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5002#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5001#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5000#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4999#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4998#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4997#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4996#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4995#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4994#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4993#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4992#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4991#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4990#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4989#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4988#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4987#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4986#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4985#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4984#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4983#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4982#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4981#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4980#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4979#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4978#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4977#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4976#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4975#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4974#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4973#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4972#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4971#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4969#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4968#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4967#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4966#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4965#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4964#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4963#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4962#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4961#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4960#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4959#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4958#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4957#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4956#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4955#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4954#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4953#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4952#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4951#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4950#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4949#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4948#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4947#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4946#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4945#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4944#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4943#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4942#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4941#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4940#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4939#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4938#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4937#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4936#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4935#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4934#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4933#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4932#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4931#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4930#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4929#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4928#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4927#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4926#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4925#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4924#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4923#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4922#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4921#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4920#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4919#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4918#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4916#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4917#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4915#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4914#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4913#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4912#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4911#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4910#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4909#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4908#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4907#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4906#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4905#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4904#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4903#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4902#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4901#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4900#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4899#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4898#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4897#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4896#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4895#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4894#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4893#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4892#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4891#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4890#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4889#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4888#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4887#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4886#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4885#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4884#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4883#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4882#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4881#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4880#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4879#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4878#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4877#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4876#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4875#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4874#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4873#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4872#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4871#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4870#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4869#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4863#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4862#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4859#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4860#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4857#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4852#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4855#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4850#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4840#L12-1 [2023-02-14 03:09:13,388 INFO L750 eck$LassoCheckResult]: Loop: 4840#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4841#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4840#L12-1 [2023-02-14 03:09:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1383057750, now seen corresponding path program 3 times [2023-02-14 03:09:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:13,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891432270] [2023-02-14 03:09:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 6525 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2023-02-14 03:09:13,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:13,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891432270] [2023-02-14 03:09:13,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891432270] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:13,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625244283] [2023-02-14 03:09:13,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:09:13,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:13,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:13,609 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:13,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-02-14 03:09:13,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-14 03:09:13,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:13,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:09:13,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 730 proven. 5 refuted. 0 times theorem prover too weak. 7740 trivial. 0 not checked. [2023-02-14 03:09:13,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 730 proven. 5 refuted. 0 times theorem prover too weak. 7740 trivial. 0 not checked. [2023-02-14 03:09:13,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625244283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:13,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:13,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-02-14 03:09:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971885892] [2023-02-14 03:09:13,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:13,718 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 6 times [2023-02-14 03:09:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:13,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99949579] [2023-02-14 03:09:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:13,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:13,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:13,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 03:09:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 03:09:13,748 INFO L87 Difference]: Start difference. First operand 241 states and 253 transitions. cyclomatic complexity: 19 Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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) [2023-02-14 03:09:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:13,934 INFO L93 Difference]: Finished difference Result 278 states and 297 transitions. [2023-02-14 03:09:13,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 297 transitions. [2023-02-14 03:09:13,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:13,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 273 states and 292 transitions. [2023-02-14 03:09:13,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-14 03:09:13,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-14 03:09:13,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 292 transitions. [2023-02-14 03:09:13,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:13,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 273 states and 292 transitions. [2023-02-14 03:09:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 292 transitions. [2023-02-14 03:09:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 257. [2023-02-14 03:09:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.0583657587548638) internal successors, (272), 256 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 272 transitions. [2023-02-14 03:09:13,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 272 transitions. [2023-02-14 03:09:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 03:09:13,941 INFO L428 stractBuchiCegarLoop]: Abstraction has 257 states and 272 transitions. [2023-02-14 03:09:13,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-14 03:09:13,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 272 transitions. [2023-02-14 03:09:13,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:13,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:13,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:13,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [78, 77, 71, 6, 1, 1, 1] [2023-02-14 03:09:13,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:13,944 INFO L748 eck$LassoCheckResult]: Stem: 6786#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6787#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 6780#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6781#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6788#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 7036#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6789#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6785#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6783#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6784#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7035#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7034#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7033#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7032#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7030#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7029#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7028#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7026#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7017#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7009#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7005#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 7002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 7001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 7000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6996#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6988#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6987#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6984#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6985#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6981#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6979#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6978#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6975#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6969#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6967#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6966#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6963#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6958#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6957#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6954#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6950#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6949#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6948#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6946#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6945#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6944#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6943#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6942#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6941#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6940#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6939#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6938#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6937#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6936#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6935#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6934#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6933#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6932#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6931#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6930#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6929#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6927#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6928#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6926#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6925#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6924#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6923#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6922#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6921#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6920#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6918#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6917#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6916#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6915#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6914#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6913#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6912#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6911#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6910#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6909#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6908#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6907#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6906#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6905#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6904#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6903#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6902#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6901#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6900#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6899#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6898#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6897#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6896#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6895#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6894#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6893#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6892#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6891#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6890#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6889#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6888#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6887#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6886#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6885#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6884#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6883#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6882#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6881#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6880#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6879#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6878#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6877#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6876#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6875#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6873#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6874#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6872#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6871#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6870#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6869#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6868#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6866#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6865#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6864#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6863#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6862#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6861#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6860#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6859#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6858#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6857#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6856#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6855#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6854#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6853#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6852#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6851#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6850#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6849#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6848#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6847#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6846#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6845#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6844#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6843#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6842#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6841#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6840#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6839#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6838#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6837#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6836#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6835#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6834#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6833#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6832#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6831#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6830#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6829#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6828#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6827#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6826#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6825#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6824#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6822#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6823#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6821#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6820#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6814#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6815#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6817#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6801#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6802#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6798#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6794#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6795#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6792#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6791#L12-1 [2023-02-14 03:09:13,944 INFO L750 eck$LassoCheckResult]: Loop: 6791#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6790#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6791#L12-1 [2023-02-14 03:09:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2031563884, now seen corresponding path program 4 times [2023-02-14 03:09:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188326645] [2023-02-14 03:09:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 154 proven. 6828 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2023-02-14 03:09:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:14,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188326645] [2023-02-14 03:09:14,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188326645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:14,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515645484] [2023-02-14 03:09:14,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:09:14,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:14,181 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:14,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-02-14 03:09:14,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:09:14,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:14,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 03:09:14,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 914 proven. 6638 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2023-02-14 03:09:14,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 914 proven. 6638 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2023-02-14 03:09:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515645484] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:15,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:15,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28, 28] total 50 [2023-02-14 03:09:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268545092] [2023-02-14 03:09:15,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:15,065 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 7 times [2023-02-14 03:09:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:15,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680217866] [2023-02-14 03:09:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:15,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:15,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-14 03:09:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=1767, Unknown=0, NotChecked=0, Total=2450 [2023-02-14 03:09:15,079 INFO L87 Difference]: Start difference. First operand 257 states and 272 transitions. cyclomatic complexity: 23 Second operand has 50 states, 50 states have (on average 3.18) internal successors, (159), 50 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:16,755 INFO L93 Difference]: Finished difference Result 1240 states and 1416 transitions. [2023-02-14 03:09:16,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1240 states and 1416 transitions. [2023-02-14 03:09:16,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:16,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1240 states to 987 states and 1104 transitions. [2023-02-14 03:09:16,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-02-14 03:09:16,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-14 03:09:16,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 987 states and 1104 transitions. [2023-02-14 03:09:16,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:16,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 987 states and 1104 transitions. [2023-02-14 03:09:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states and 1104 transitions. [2023-02-14 03:09:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 691. [2023-02-14 03:09:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 691 states have (on average 1.1128798842257597) internal successors, (769), 690 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 769 transitions. [2023-02-14 03:09:16,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 691 states and 769 transitions. [2023-02-14 03:09:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2023-02-14 03:09:16,777 INFO L428 stractBuchiCegarLoop]: Abstraction has 691 states and 769 transitions. [2023-02-14 03:09:16,777 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-14 03:09:16,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 769 transitions. [2023-02-14 03:09:16,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:16,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:16,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:16,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [95, 94, 83, 11, 1, 1, 1] [2023-02-14 03:09:16,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:16,781 INFO L748 eck$LassoCheckResult]: Stem: 10157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 10152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10153#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10159#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10571#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10570#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10569#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10568#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10567#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10566#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10564#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10563#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10562#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10561#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10560#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10559#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10558#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10557#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10556#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10555#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10554#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10553#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10551#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10550#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10549#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10548#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10547#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10546#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10544#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10542#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10539#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10538#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10536#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10534#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10533#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10532#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10531#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10530#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10529#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10528#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10527#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10526#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10525#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10524#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10522#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10521#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10520#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10519#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10518#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10517#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10514#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10515#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10511#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10494#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10493#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10491#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10490#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10489#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10487#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10486#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10485#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10484#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10483#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10482#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10481#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10480#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10479#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10478#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10477#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10475#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10474#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10473#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10472#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10471#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10470#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10469#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10468#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10467#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10466#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10465#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10464#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10463#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10462#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10461#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10460#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10459#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10458#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10457#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10455#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10454#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10453#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10452#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10451#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10450#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10449#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10448#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10447#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10446#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10445#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10444#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10443#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10442#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10441#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10440#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10439#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10438#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10437#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10436#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10435#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10434#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10433#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10432#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10431#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10430#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10429#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10428#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10426#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10425#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10424#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10423#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10422#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10421#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10420#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10419#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10418#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10417#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10416#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10415#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10414#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10413#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10412#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10411#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10410#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10409#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10408#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10407#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10406#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10405#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10404#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10403#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10402#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10400#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10399#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10398#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10397#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10396#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10395#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10394#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10393#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10392#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10391#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10390#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10389#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10388#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10387#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10386#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10385#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10384#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10383#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10382#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10381#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10380#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10378#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10376#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10374#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10372#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10370#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10368#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10366#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10364#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10362#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10360#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10358#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10356#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10354#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10352#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10350#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10348#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10346#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10344#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10322#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10323#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10340#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10338#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10336#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10316#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10314#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10315#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10311#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10272#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10326#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10303#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10302#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10301#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10300#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10299#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10266#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10263#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10260#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10257#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10254#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10252#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10250#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10248#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10247#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10246#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10245#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10233#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10227#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10226#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10225#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10224#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10222#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10223#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10232#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10221#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10213#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10212#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10211#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10210#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10207#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10205#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10206#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10208#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10200#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10199#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10198#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10197#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10195#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10192#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10193#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10196#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10194#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10188#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10187#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10186#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10185#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10184#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10183#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10170#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10182#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10180#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10179#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10175#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10176#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10172#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10168#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10169#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10166#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10163#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10165#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10160#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10161#L12-1 [2023-02-14 03:09:16,782 INFO L750 eck$LassoCheckResult]: Loop: 10161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10164#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10161#L12-1 [2023-02-14 03:09:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2005033964, now seen corresponding path program 5 times [2023-02-14 03:09:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:16,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520576218] [2023-02-14 03:09:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 5787 proven. 5686 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2023-02-14 03:09:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520576218] [2023-02-14 03:09:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520576218] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271647571] [2023-02-14 03:09:17,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:09:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:17,443 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-02-14 03:09:17,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2023-02-14 03:09:17,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:17,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 03:09:17,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 7724 proven. 317 refuted. 0 times theorem prover too weak. 5260 trivial. 0 not checked. [2023-02-14 03:09:17,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 7724 proven. 317 refuted. 0 times theorem prover too weak. 5260 trivial. 0 not checked. [2023-02-14 03:09:18,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271647571] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:18,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:18,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 44 [2023-02-14 03:09:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742327672] [2023-02-14 03:09:18,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:18,141 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 8 times [2023-02-14 03:09:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70111059] [2023-02-14 03:09:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:18,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:18,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-14 03:09:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=1381, Unknown=0, NotChecked=0, Total=1892 [2023-02-14 03:09:18,160 INFO L87 Difference]: Start difference. First operand 691 states and 769 transitions. cyclomatic complexity: 85 Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 44 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:19,529 INFO L93 Difference]: Finished difference Result 1294 states and 1395 transitions. [2023-02-14 03:09:19,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1294 states and 1395 transitions. [2023-02-14 03:09:19,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:19,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1294 states to 1184 states and 1285 transitions. [2023-02-14 03:09:19,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-14 03:09:19,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-14 03:09:19,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1184 states and 1285 transitions. [2023-02-14 03:09:19,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:19,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1184 states and 1285 transitions. [2023-02-14 03:09:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states and 1285 transitions. [2023-02-14 03:09:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 526. [2023-02-14 03:09:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 526 states have (on average 1.0874524714828897) internal successors, (572), 525 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 572 transitions. [2023-02-14 03:09:19,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 526 states and 572 transitions. [2023-02-14 03:09:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-02-14 03:09:19,547 INFO L428 stractBuchiCegarLoop]: Abstraction has 526 states and 572 transitions. [2023-02-14 03:09:19,547 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-14 03:09:19,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 526 states and 572 transitions. [2023-02-14 03:09:19,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:19,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:19,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:19,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [131, 130, 115, 15, 1, 1, 1] [2023-02-14 03:09:19,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:19,552 INFO L748 eck$LassoCheckResult]: Stem: 14071#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 14072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 14066#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14067#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14073#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14549#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14548#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14547#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14546#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14545#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14544#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14543#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14541#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14540#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14539#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14538#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14537#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14536#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14535#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14534#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14533#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14532#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14530#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14529#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14528#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14527#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14526#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14525#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14523#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14522#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14520#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14519#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14518#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14517#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14516#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14515#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14514#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14511#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14493#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14494#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14491#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14490#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14489#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14487#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14486#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14485#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14484#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14483#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14482#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14481#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14480#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14479#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14478#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14477#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14475#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14474#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14473#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14472#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14471#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14470#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14469#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14468#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14467#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14466#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14465#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14464#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14463#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14462#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14461#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14460#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14459#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14458#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14457#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14456#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14455#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14454#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14453#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14452#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14451#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14450#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14449#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14448#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14447#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14446#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14445#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14444#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14443#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14442#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14441#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14440#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14439#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14438#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14436#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14437#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14435#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14434#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14433#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14432#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14431#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14430#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14429#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14428#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14427#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14426#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14425#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14424#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14423#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14422#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14421#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14420#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14419#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14418#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14417#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14416#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14415#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14414#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14413#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14412#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14411#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14410#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14409#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14408#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14407#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14406#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14405#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14404#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14403#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14402#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14401#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14400#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14399#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14398#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14397#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14396#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14395#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14394#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14393#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14392#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14391#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14390#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14389#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14388#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14387#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14386#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14385#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14384#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14381#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14383#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14380#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14382#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14589#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14588#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14587#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14586#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14585#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14584#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14583#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14582#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14581#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14580#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14579#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14578#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14577#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14576#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14575#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14574#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14573#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14572#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14571#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14570#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14569#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14568#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14567#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14566#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14565#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14564#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14563#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14562#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14561#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14559#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14558#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14347#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14348#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14556#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14343#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14342#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14341#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14339#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14340#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14560#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14335#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14334#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14333#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14332#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14331#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14330#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14329#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14269#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14328#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14327#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14321#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14379#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14378#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14377#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14376#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14375#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14374#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14373#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14372#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14371#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14370#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14369#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14368#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14367#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14366#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14365#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14364#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14363#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14362#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14361#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14360#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14359#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14358#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14357#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14356#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14355#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14354#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14353#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14352#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14351#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14223#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14349#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14350#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14074#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14075#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14266#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14265#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14264#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14263#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14238#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14237#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14235#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14234#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14233#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14232#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14231#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14229#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14230#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14246#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14224#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14225#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14221#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14220#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14219#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14218#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14217#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14216#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14214#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14213#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14212#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14211#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14210#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14204#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14203#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14201#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14199#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14197#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14198#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14194#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14193#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14192#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14191#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14190#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14189#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14188#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14187#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14186#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14185#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14184#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14183#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14182#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14181#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14177#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14175#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14173#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14174#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14170#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14169#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14168#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14167#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14166#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14165#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14164#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14163#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14162#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14161#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14160#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14159#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14158#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14157#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14152#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14153#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14149#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14148#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14147#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14146#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14145#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14144#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14143#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14142#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14141#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14140#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14139#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14138#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14137#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14136#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14135#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14118#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14134#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14132#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14131#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14130#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14129#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14128#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14127#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14126#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14125#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14124#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14123#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14122#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14121#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14120#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14106#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14119#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14117#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14116#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14115#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14114#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14113#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14112#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14111#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14110#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14109#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14108#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14097#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14107#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14105#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14104#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14103#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14102#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14101#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14086#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14098#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14091#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14092#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14088#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14084#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14085#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14082#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14080#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14081#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14078#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14077#L12-1 [2023-02-14 03:09:19,552 INFO L750 eck$LassoCheckResult]: Loop: 14077#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14076#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14077#L12-1 [2023-02-14 03:09:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1703910940, now seen corresponding path program 6 times [2023-02-14 03:09:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:19,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757085916] [2023-02-14 03:09:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 12928 proven. 8663 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2023-02-14 03:09:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:20,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757085916] [2023-02-14 03:09:20,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757085916] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:20,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447305164] [2023-02-14 03:09:20,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:09:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:20,581 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:20,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-02-14 03:09:20,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 81 check-sat command(s) [2023-02-14 03:09:20,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:20,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 03:09:20,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 8831 proven. 411 refuted. 0 times theorem prover too weak. 16173 trivial. 0 not checked. [2023-02-14 03:09:20,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 8831 proven. 411 refuted. 0 times theorem prover too weak. 16173 trivial. 0 not checked. [2023-02-14 03:09:21,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447305164] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:21,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:21,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 37 [2023-02-14 03:09:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288029302] [2023-02-14 03:09:21,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:21,232 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 9 times [2023-02-14 03:09:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:21,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534485162] [2023-02-14 03:09:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:21,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:21,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:21,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 03:09:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 03:09:21,248 INFO L87 Difference]: Start difference. First operand 526 states and 572 transitions. cyclomatic complexity: 53 Second operand has 37 states, 37 states have (on average 3.324324324324324) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:22,774 INFO L93 Difference]: Finished difference Result 686 states and 729 transitions. [2023-02-14 03:09:22,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 729 transitions. [2023-02-14 03:09:22,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:22,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 635 states and 675 transitions. [2023-02-14 03:09:22,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-14 03:09:22,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-14 03:09:22,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 675 transitions. [2023-02-14 03:09:22,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:22,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 635 states and 675 transitions. [2023-02-14 03:09:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 675 transitions. [2023-02-14 03:09:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 427. [2023-02-14 03:09:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 427 states have (on average 1.0281030444964872) internal successors, (439), 426 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 439 transitions. [2023-02-14 03:09:22,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 427 states and 439 transitions. [2023-02-14 03:09:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-02-14 03:09:22,782 INFO L428 stractBuchiCegarLoop]: Abstraction has 427 states and 439 transitions. [2023-02-14 03:09:22,782 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-14 03:09:22,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 439 transitions. [2023-02-14 03:09:22,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:22,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:22,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:22,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [140, 140, 125, 15, 1, 1] [2023-02-14 03:09:22,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:22,788 INFO L748 eck$LassoCheckResult]: Stem: 17859#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 17860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 17851#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17852#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17861#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18277#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17862#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17858#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17854#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17855#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18276#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18275#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18274#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18273#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18272#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18271#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18270#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18269#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18268#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18267#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18266#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18265#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18264#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18263#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18262#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18261#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18260#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18259#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18258#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18257#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18256#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18255#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18254#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18253#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18252#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18251#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18250#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18249#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18248#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18247#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18246#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18245#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18244#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18243#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18242#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18241#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18240#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18239#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18238#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18237#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18236#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18235#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18234#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18233#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18232#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18231#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18230#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18229#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18228#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18227#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18225#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18226#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18224#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18223#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18222#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18221#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18220#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18219#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18218#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18217#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18216#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18215#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18214#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18213#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18212#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18211#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18210#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18209#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18208#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18207#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18206#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18205#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18204#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18203#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18202#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18201#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18200#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18199#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18198#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18197#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18196#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18195#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18194#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18193#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18192#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18191#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18190#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18189#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18188#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18187#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18186#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18185#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18184#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18183#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18182#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18181#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18180#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18179#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18178#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18177#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18176#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18175#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18174#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18173#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18172#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18171#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18170#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18168#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18169#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18167#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18166#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18165#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18163#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18162#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18159#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18158#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18157#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18156#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18153#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18147#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18145#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18144#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18143#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18142#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18141#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18140#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18139#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18138#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18137#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18136#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18135#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18134#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18133#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18132#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18131#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18130#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18129#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18128#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18127#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18126#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18125#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18124#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18123#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18122#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18121#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18120#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18119#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18118#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18117#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18116#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18114#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18115#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18113#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18112#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18111#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18110#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18109#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18108#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18107#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18106#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18105#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18104#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18103#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18102#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18101#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18100#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18099#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18098#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18097#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18096#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18095#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18094#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18093#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18092#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18091#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18090#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18089#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18088#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18087#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18086#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18085#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18084#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18083#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18082#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18081#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18080#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18079#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18078#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18077#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18076#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18075#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18074#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18073#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18072#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18071#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18070#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18069#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18068#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18067#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18066#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18065#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17987#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18064#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18061#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18060#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18059#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18054#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18053#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18051#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18050#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18048#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18047#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18045#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18043#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18042#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18041#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18039#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18038#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18036#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18035#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18034#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18033#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18032#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17957#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18030#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17984#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17981#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17979#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17978#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17975#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17969#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17967#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17966#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17963#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17930#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17958#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17954#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17950#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17949#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17948#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17946#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17945#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17944#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17943#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17942#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17941#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17940#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17939#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17938#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17937#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17936#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17935#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17934#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17933#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17932#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17906#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17931#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17929#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17928#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17927#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17926#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17925#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17924#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17923#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17922#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17921#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17920#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17918#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17917#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17916#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17915#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17914#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17913#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17912#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17911#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17910#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17909#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17908#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17885#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17907#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17905#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17904#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17903#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17902#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17901#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17900#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17899#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17898#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17897#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17896#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17895#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17894#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17893#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17892#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17891#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17890#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17889#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17888#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17887#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17866#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17886#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17884#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17883#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17882#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17881#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17880#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17879#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17878#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17877#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17876#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17875#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17874#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17873#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17872#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17871#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17870#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17869#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17868#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17865#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17863#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17856#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17857#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17864#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18029#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18028#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18026#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18017#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18009#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18005#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 18004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 18002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 18001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17996#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17988#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17989#L12-1 [2023-02-14 03:09:22,788 INFO L750 eck$LassoCheckResult]: Loop: 17989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17990#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17989#L12-1 [2023-02-14 03:09:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1848898559, now seen corresponding path program 9 times [2023-02-14 03:09:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:22,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060627844] [2023-02-14 03:09:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 13932 proven. 9015 refuted. 0 times theorem prover too weak. 6243 trivial. 0 not checked. [2023-02-14 03:09:23,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:23,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060627844] [2023-02-14 03:09:23,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060627844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:23,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265462809] [2023-02-14 03:09:23,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:09:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:23,288 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:23,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-02-14 03:09:23,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 117 check-sat command(s) [2023-02-14 03:09:23,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:23,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 03:09:23,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 14745 proven. 8053 refuted. 0 times theorem prover too weak. 6392 trivial. 0 not checked. [2023-02-14 03:09:24,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 14745 proven. 8053 refuted. 0 times theorem prover too weak. 6392 trivial. 0 not checked. [2023-02-14 03:09:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265462809] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:24,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:24,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 44 [2023-02-14 03:09:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776446211] [2023-02-14 03:09:24,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:24,522 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 10 times [2023-02-14 03:09:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:24,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776056508] [2023-02-14 03:09:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:24,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:24,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-14 03:09:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2023-02-14 03:09:24,537 INFO L87 Difference]: Start difference. First operand 427 states and 439 transitions. cyclomatic complexity: 18 Second operand has 44 states, 44 states have (on average 3.4318181818181817) internal successors, (151), 44 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:28,623 INFO L93 Difference]: Finished difference Result 741 states and 777 transitions. [2023-02-14 03:09:28,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 741 states and 777 transitions. [2023-02-14 03:09:28,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:28,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 741 states to 706 states and 742 transitions. [2023-02-14 03:09:28,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-02-14 03:09:28,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2023-02-14 03:09:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 742 transitions. [2023-02-14 03:09:28,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:28,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 706 states and 742 transitions. [2023-02-14 03:09:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 742 transitions. [2023-02-14 03:09:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 607. [2023-02-14 03:09:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 607 states have (on average 1.031301482701812) internal successors, (626), 606 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 626 transitions. [2023-02-14 03:09:28,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 607 states and 626 transitions. [2023-02-14 03:09:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2023-02-14 03:09:28,674 INFO L428 stractBuchiCegarLoop]: Abstraction has 607 states and 626 transitions. [2023-02-14 03:09:28,674 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-14 03:09:28,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 626 transitions. [2023-02-14 03:09:28,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:28,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:28,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:28,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [161, 161, 144, 17, 1, 1] [2023-02-14 03:09:28,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:28,681 INFO L748 eck$LassoCheckResult]: Stem: 21941#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 21942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 21934#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21935#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21943#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22540#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22539#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22538#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22537#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22536#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22535#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22534#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22533#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22532#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22530#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22529#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22528#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22527#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22526#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22525#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22523#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22522#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22520#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22519#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22518#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22517#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22516#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22515#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22514#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22511#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22494#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22493#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22491#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22490#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22489#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22487#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22486#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22484#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22485#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22483#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22482#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22481#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22480#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22479#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22478#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22477#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22475#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22474#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22473#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22472#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22471#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22470#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22469#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22468#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22467#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22466#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22465#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22464#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22463#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22462#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22461#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22460#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22459#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22458#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22457#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22456#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22455#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22454#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22453#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22452#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22451#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22450#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22449#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22448#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22447#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22446#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22445#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22444#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22443#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22442#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22441#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22440#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22439#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22438#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22437#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22436#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22435#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22434#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22433#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22432#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22431#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22430#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22429#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22428#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22426#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22425#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22424#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22423#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22422#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22421#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22420#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22419#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22418#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22417#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22416#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22415#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22414#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22413#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22412#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22411#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22410#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22409#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22408#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22407#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22406#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22405#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22404#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22403#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22402#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22401#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22400#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22399#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22398#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22397#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22396#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22395#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22394#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22393#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22392#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22391#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22390#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22389#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22388#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22387#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22386#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22385#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22384#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22383#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22382#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22381#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22380#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22379#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22378#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22377#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22376#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22375#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22373#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22374#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22372#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22371#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22370#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22369#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22368#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22367#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22366#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22365#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22364#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22363#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22362#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22361#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22360#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22359#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22358#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22357#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22356#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22355#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22354#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22353#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22352#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22351#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22350#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22349#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22348#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22347#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22346#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22345#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22344#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22343#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22342#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22341#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22340#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22339#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22338#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22337#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22336#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22335#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22334#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22333#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22332#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22331#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22330#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22329#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22328#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22327#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22326#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22325#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22324#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22322#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22323#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22321#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22320#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22319#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22318#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22317#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22316#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22315#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22314#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22313#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22312#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22311#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22309#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22308#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22307#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22306#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22305#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22304#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22303#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22302#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22301#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22300#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22299#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22298#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22297#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22296#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22295#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22294#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22293#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22292#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22291#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22290#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22289#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22288#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22287#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22286#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22285#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22284#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22283#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22282#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22192#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22193#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22191#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22190#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22189#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22188#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22187#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22186#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22185#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22184#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22183#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22182#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22181#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22180#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22179#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22178#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22177#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22176#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22175#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22174#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22173#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22172#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22171#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22170#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22169#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22168#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22167#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22166#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22165#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22163#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22162#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22159#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22157#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22156#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22155#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22154#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22153#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22152#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22151#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22150#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22149#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22148#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22147#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22146#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22145#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22144#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22143#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22142#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22141#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22140#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22139#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22138#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22137#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22136#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22135#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22134#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22133#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22132#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22131#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22130#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22129#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22128#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22126#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22125#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22124#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22123#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22122#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22121#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22120#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22119#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22118#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22117#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22116#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22115#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22114#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22113#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22112#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22111#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22110#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22109#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22108#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22107#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22106#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22105#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22104#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22103#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22102#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22101#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22098#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22097#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22094#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22093#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22091#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22090#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22089#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22088#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22087#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22086#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22085#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22084#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22083#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22082#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22081#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22080#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22079#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22076#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22074#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22072#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22070#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22068#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22066#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22064#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22062#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22060#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22056#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22054#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22050#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22048#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22044#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22042#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22038#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22036#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22035#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22034#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22033#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22032#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22026#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 22025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22017#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21947#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22009#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21963#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21958#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21957#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21954#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21950#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21949#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21948#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21946#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21944#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21938#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21939#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21945#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22005#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 22002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 22001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 22000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21996#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21988#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21987#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21984#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21981#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21979#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21978#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21975#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21967#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21968#L12-1 [2023-02-14 03:09:28,681 INFO L750 eck$LassoCheckResult]: Loop: 21968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21969#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21968#L12-1 [2023-02-14 03:09:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:28,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2044987687, now seen corresponding path program 10 times [2023-02-14 03:09:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:28,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190861939] [2023-02-14 03:09:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:28,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 18300 proven. 12627 refuted. 0 times theorem prover too weak. 7713 trivial. 0 not checked. [2023-02-14 03:09:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:29,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190861939] [2023-02-14 03:09:29,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190861939] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 03:09:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101307558] [2023-02-14 03:09:29,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:09:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:29,234 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:29,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-02-14 03:09:29,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:09:29,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:29,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 03:09:29,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 20020 proven. 9572 refuted. 0 times theorem prover too weak. 9048 trivial. 0 not checked. [2023-02-14 03:09:29,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 20020 proven. 9572 refuted. 0 times theorem prover too weak. 9048 trivial. 0 not checked. [2023-02-14 03:09:30,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101307558] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:30,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 03:09:30,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 40, 40] total 57 [2023-02-14 03:09:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007916642] [2023-02-14 03:09:30,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:30,386 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:09:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 11 times [2023-02-14 03:09:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:30,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421112454] [2023-02-14 03:09:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:30,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:30,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:30,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-14 03:09:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=2542, Unknown=0, NotChecked=0, Total=3192 [2023-02-14 03:09:30,403 INFO L87 Difference]: Start difference. First operand 607 states and 626 transitions. cyclomatic complexity: 26 Second operand has 57 states, 57 states have (on average 3.192982456140351) internal successors, (182), 57 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:35,295 INFO L93 Difference]: Finished difference Result 1362 states and 1418 transitions. [2023-02-14 03:09:35,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 1418 transitions. [2023-02-14 03:09:35,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:35,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1282 states and 1338 transitions. [2023-02-14 03:09:35,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2023-02-14 03:09:35,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2023-02-14 03:09:35,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1338 transitions. [2023-02-14 03:09:35,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:35,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1338 transitions. [2023-02-14 03:09:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1338 transitions. [2023-02-14 03:09:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 637. [2023-02-14 03:09:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 637 states have (on average 1.0266875981161696) internal successors, (654), 636 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 03:09:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 654 transitions. [2023-02-14 03:09:35,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 637 states and 654 transitions. [2023-02-14 03:09:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2023-02-14 03:09:35,324 INFO L428 stractBuchiCegarLoop]: Abstraction has 637 states and 654 transitions. [2023-02-14 03:09:35,324 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-14 03:09:35,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 637 states and 654 transitions. [2023-02-14 03:09:35,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-14 03:09:35,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:35,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:35,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [210, 210, 190, 20, 1, 1] [2023-02-14 03:09:35,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-14 03:09:35,335 INFO L748 eck$LassoCheckResult]: Stem: 27526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 27527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 27519#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27528#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 28155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28153#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28147#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28145#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28144#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28143#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28142#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28141#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28140#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28139#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28138#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28137#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28136#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28135#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28134#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28133#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28132#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28131#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28130#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28129#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28128#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28127#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28126#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28125#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28124#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28123#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28122#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28121#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28120#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28119#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28118#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28117#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28116#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28115#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28114#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28113#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28112#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28111#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28110#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28109#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28108#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28107#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28106#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28105#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28104#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28103#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28102#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28101#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28043#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28098#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28097#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 28096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28094#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28093#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28091#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28090#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28089#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28088#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28087#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28086#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28085#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28084#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28083#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28082#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28081#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28080#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28079#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28078#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28077#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28076#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28075#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28074#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28073#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28072#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28071#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28070#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28069#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28068#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28067#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28066#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28065#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28064#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28063#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28062#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28061#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28060#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28059#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28058#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28057#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28056#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28055#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28054#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28053#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28052#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28051#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28050#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28049#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28048#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28047#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28046#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28045#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27989#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28042#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28041#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28040#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 28039#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28038#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28037#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28036#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28035#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28034#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28033#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28032#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28031#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28030#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28029#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28028#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28027#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28026#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28025#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28024#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28023#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28022#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28021#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28020#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28019#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28018#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28017#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28016#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28015#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28014#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28013#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28012#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28011#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28010#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28009#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28008#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28007#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28006#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28005#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28004#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28003#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 28002#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 28001#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 28000#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27999#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27998#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27997#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27996#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27995#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27994#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27993#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27992#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27991#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27938#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27988#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27987#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27986#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27985#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27984#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27983#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27982#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27981#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27980#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27979#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27978#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27977#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27976#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27975#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27974#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27973#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27972#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27971#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27970#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27969#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27968#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27967#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27966#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27965#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27964#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27963#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27962#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27961#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27960#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27959#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27958#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27957#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27956#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27955#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27954#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27953#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27952#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27951#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27950#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27949#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27948#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27947#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27946#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27945#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27944#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27943#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27942#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27941#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27940#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27890#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27939#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27937#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27936#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27935#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27934#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27933#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27932#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27931#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27930#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27929#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27928#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27927#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27926#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27925#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27924#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27923#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27922#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27921#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27920#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27919#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27918#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27917#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27916#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27915#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27914#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27913#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27912#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27911#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27910#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27909#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27908#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27907#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27906#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27905#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27904#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27903#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27902#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27901#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27900#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27899#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27898#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27897#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27896#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27895#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27894#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27893#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27892#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27845#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27891#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27889#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27888#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27887#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27886#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27885#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27884#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27883#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27882#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27881#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27880#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27879#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27878#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27877#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27876#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27875#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27874#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27873#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27872#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27871#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27870#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27869#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27868#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27867#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27866#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27865#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27864#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27863#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27862#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27861#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27860#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27859#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27858#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27857#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27856#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27855#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27854#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27853#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27852#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27851#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27850#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27849#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27848#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27847#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27803#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27846#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27844#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27843#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27842#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27841#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27840#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27839#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27838#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27837#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27836#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27835#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27834#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27833#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27832#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27831#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27830#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27829#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27828#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27827#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27826#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27825#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27824#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27823#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27822#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27821#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27820#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27819#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27818#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27817#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27816#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27815#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27814#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27813#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27812#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27811#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27810#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27809#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27808#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27807#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27806#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27805#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27764#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27804#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27802#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27801#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27800#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27799#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27798#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27797#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27796#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27795#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27794#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27793#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27792#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27791#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27790#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27789#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27788#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27787#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27786#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27785#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27784#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27783#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27782#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27781#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27780#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27779#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27778#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27777#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27776#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27775#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27774#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27773#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27772#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27771#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27770#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27769#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27768#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27767#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27766#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27728#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27765#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27763#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27762#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27761#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27760#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27759#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27758#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27757#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27756#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27755#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27754#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27753#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27752#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27751#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27750#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27749#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27748#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27747#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27746#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27745#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27744#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27743#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27742#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27741#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27740#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27739#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27738#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27737#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27736#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27735#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27734#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27733#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27732#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27731#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27730#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27695#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27729#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27727#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27726#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27725#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27724#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27723#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27722#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27721#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27720#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27719#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27718#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27717#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27716#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27715#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27714#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27713#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27712#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27711#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27710#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27709#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27708#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27707#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27706#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27705#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27704#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27703#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27702#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27701#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27700#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27699#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27698#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27697#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27665#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27696#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27694#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27693#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27692#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27691#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27690#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27689#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27688#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27687#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27686#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27685#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27683#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27682#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27681#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27680#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27679#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27678#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27677#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27676#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27675#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27674#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27673#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27672#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27671#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27670#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27669#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27668#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27667#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27638#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27666#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27663#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27662#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27661#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27660#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27659#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27658#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27657#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27656#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27655#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27654#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27653#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27652#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27651#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27650#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27649#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27648#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27647#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27646#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27645#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27644#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27643#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27642#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27641#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27640#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27614#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27639#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27637#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27636#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27635#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27634#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27633#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27632#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27631#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27630#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27629#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27628#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27627#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27626#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27625#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27624#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27623#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27622#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27621#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27620#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27619#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27618#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27617#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27616#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27551#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27615#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27613#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27612#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27611#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27610#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27609#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27608#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27607#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27606#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27605#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27604#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27603#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27602#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27601#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27600#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27599#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27598#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27597#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27596#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27595#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27532#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27552#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27550#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27549#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27548#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27547#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27546#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27544#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27542#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27539#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27538#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27536#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27534#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27533#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27529#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27523#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27524#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27530#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27594#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27593#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27592#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27591#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27590#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27589#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27588#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27587#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27586#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27585#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27584#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27583#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27582#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27581#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27580#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27579#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27578#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27577#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27576#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27575#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27574#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27573#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27570#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27569#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27568#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27567#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27566#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27565#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27564#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27563#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27562#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27561#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27560#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27559#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27558#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27557#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27556#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27553#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27554#L12-1 [2023-02-14 03:09:35,335 INFO L750 eck$LassoCheckResult]: Loop: 27554#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27555#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27554#L12-1 [2023-02-14 03:09:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -686017405, now seen corresponding path program 11 times [2023-02-14 03:09:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:35,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770778679] [2023-02-14 03:09:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 12 times [2023-02-14 03:09:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:35,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938848840] [2023-02-14 03:09:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2132729554, now seen corresponding path program 7 times [2023-02-14 03:09:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:35,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675722115] [2023-02-14 03:09:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:35,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:10:14,905 WARN L233 SmtUtils]: Spent 38.99s on a formula simplification. DAG size of input: 2128 DAG size of output: 661 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-14 03:10:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:10:15,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:10:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:10:15,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.02 03:10:15 BoogieIcfgContainer [2023-02-14 03:10:15,334 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-14 03:10:15,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 03:10:15,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 03:10:15,334 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 03:10:15,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:09:05" (3/4) ... [2023-02-14 03:10:15,336 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-14 03:10:15,428 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 03:10:15,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 03:10:15,429 INFO L158 Benchmark]: Toolchain (without parser) took 70325.01ms. Allocated memory was 153.1MB in the beginning and 717.2MB in the end (delta: 564.1MB). Free memory was 107.4MB in the beginning and 544.7MB in the end (delta: -437.2MB). Peak memory consumption was 128.8MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,429 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:10:15,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.59ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 98.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.63ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 96.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:10:15,430 INFO L158 Benchmark]: Boogie Preprocessor took 13.72ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 95.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,430 INFO L158 Benchmark]: RCFGBuilder took 194.65ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 87.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,430 INFO L158 Benchmark]: BuchiAutomizer took 69858.89ms. Allocated memory was 153.1MB in the beginning and 717.2MB in the end (delta: 564.1MB). Free memory was 87.1MB in the beginning and 564.6MB in the end (delta: -477.5MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,431 INFO L158 Benchmark]: Witness Printer took 94.75ms. Allocated memory is still 717.2MB. Free memory was 564.6MB in the beginning and 544.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-14 03:10:15,432 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.59ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 98.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.63ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 96.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.72ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 95.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 194.65ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 87.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 69858.89ms. Allocated memory was 153.1MB in the beginning and 717.2MB in the end (delta: 564.1MB). Free memory was 87.1MB in the beginning and 564.6MB in the end (delta: -477.5MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. * Witness Printer took 94.75ms. Allocated memory is still 717.2MB. Free memory was 564.6MB in the beginning and 544.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (13 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One deterministic module has affine ranking function range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 57 locations. The remainder module has 637 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.6s and 17 iterations. TraceHistogramMax:210. Analysis of lassos took 53.5s. Construction of modules took 2.5s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1997 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 11/12 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 1199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6227 IncrementalHoareTripleChecker+Invalid, 7426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1199 mSolverCounterUnsat, 92 mSDtfsCounter, 6227 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc3 concLT0 SILN8 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax167 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf94 smp76 dnf100 smp100 tf109 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 VAL [range=20] [L11] COND TRUE 0 <= i && i <= range VAL [i=20, range=20] [L12] COND TRUE !(0 == i && i == range) VAL [i=20, range=20] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=19, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=19, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=19, range=19] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=18] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=17] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=16] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=15] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=14] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=13] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=12] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=11] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=10] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=9] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=8] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=7] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=6] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=5] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=4] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=3] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=2] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=1] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=1] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=0] Loop: [L11] COND TRUE 0 <= i && i <= range [L12] COND FALSE !(!(0 == i && i == range)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 VAL [range=20] [L11] COND TRUE 0 <= i && i <= range VAL [i=20, range=20] [L12] COND TRUE !(0 == i && i == range) VAL [i=20, range=20] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=19, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=19, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=19, range=19] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=18] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=17] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=16] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=15] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=14] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=13] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=12] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=11] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=10] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=9] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=8] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=7] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=6] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=5] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=4] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=3] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=2] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=1] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=1] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=0] Loop: [L11] COND TRUE 0 <= i && i <= range [L12] COND FALSE !(!(0 == i && i == range)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-14 03:10:15,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:15,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-02-14 03:10:15,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-02-14 03:10:16,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:16,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:16,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-02-14 03:10:16,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:16,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:17,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:17,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:17,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 03:10:17,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)