./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 574ddb4e 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-?-574ddb4 [2023-02-17 09:42:58,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:42:58,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:42:58,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:42:58,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:42:58,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:42:58,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:42:58,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:42:58,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:42:58,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:42:58,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:42:58,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:42:58,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:42:58,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:42:58,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:42:58,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:42:58,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:42:58,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:42:58,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:42:58,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:42:58,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:42:58,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:42:58,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:42:58,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:42:58,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:42:58,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:42:58,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:42:58,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:42:58,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:42:58,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:42:58,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:42:58,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:42:58,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:42:58,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:42:58,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:42:58,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:42:58,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:42:58,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:42:58,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:42:58,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:42:58,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:42:58,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-17 09:42:58,175 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:42:58,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:42:58,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:42:58,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:42:58,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:42:58,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:42:58,177 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:42:58,177 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-17 09:42:58,177 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-17 09:42:58,178 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-17 09:42:58,178 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-17 09:42:58,178 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-17 09:42:58,178 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-17 09:42:58,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:42:58,179 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:42:58,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:42:58,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:42:58,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-17 09:42:58,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-17 09:42:58,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:42:58,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:42:58,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:42:58,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:42:58,182 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-17 09:42:58,182 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-17 09:42:58,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:42:58,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:42:58,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:42:58,501 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:42:58,501 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:42:58,502 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-17 09:42:59,487 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:42:59,635 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:42:59,636 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2023-02-17 09:42:59,640 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af29e70a6/a1bb07eeaaf74d1d88eaf17130cec665/FLAG8d72d497e [2023-02-17 09:42:59,653 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af29e70a6/a1bb07eeaaf74d1d88eaf17130cec665 [2023-02-17 09:42:59,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:42:59,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:42:59,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:42:59,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:42:59,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:42:59,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb83383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59, skipping insertion in model container [2023-02-17 09:42:59,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:42:59,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:42:59,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:42:59,785 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:42:59,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:42:59,802 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:42:59,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59 WrapperNode [2023-02-17 09:42:59,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:42:59,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:42:59,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:42:59,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:42:59,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,822 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-02-17 09:42:59,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:42:59,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:42:59,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:42:59,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:42:59,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,835 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:42:59,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:42:59,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:42:59,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:42:59,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (1/1) ... [2023-02-17 09:42:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:42:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:42:59,861 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-17 09:42:59,879 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-17 09:42:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:42:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:42:59,939 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:42:59,941 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:43:00,007 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:43:00,011 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:43:00,012 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 09:43:00,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:00 BoogieIcfgContainer [2023-02-17 09:43:00,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:43:00,014 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-17 09:43:00,014 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-17 09:43:00,016 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-17 09:43:00,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:00,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.02 09:42:59" (1/3) ... [2023-02-17 09:43:00,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f270d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:43:00, skipping insertion in model container [2023-02-17 09:43:00,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:00,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:42:59" (2/3) ... [2023-02-17 09:43:00,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f270d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:43:00, skipping insertion in model container [2023-02-17 09:43:00,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:43:00,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:00" (3/3) ... [2023-02-17 09:43:00,020 INFO L332 chiAutomizerObserver]: Analyzing ICFG NarrowKonv.c [2023-02-17 09:43:00,071 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-17 09:43:00,071 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-17 09:43:00,071 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-17 09:43:00,071 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-17 09:43:00,072 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-17 09:43:00,072 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-17 09:43:00,072 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-17 09:43:00,073 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-17 09:43:00,075 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-17 09:43:00,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-17 09:43:00,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:00,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:00,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:00,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:00,092 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-17 09:43:00,092 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-17 09:43:00,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-17 09:43:00,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:00,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:00,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:00,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:00,098 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-17 09:43:00,099 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-17 09:43:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-17 09:43:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303449347] [2023-02-17 09:43:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 1 times [2023-02-17 09:43:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042329517] [2023-02-17 09:43:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 925806, now seen corresponding path program 1 times [2023-02-17 09:43:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309728184] [2023-02-17 09:43:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:00,274 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-17 09:43:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:00,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309728184] [2023-02-17 09:43:00,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309728184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:00,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:00,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:43:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622834961] [2023-02-17 09:43:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:43:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:43:00,321 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-17 09:43:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:00,383 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-02-17 09:43:00,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2023-02-17 09:43:00,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:00,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 8 states and 11 transitions. [2023-02-17 09:43:00,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-17 09:43:00,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-17 09:43:00,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-17 09:43:00,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:43:00,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-17 09:43:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-17 09:43:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-17 09:43:00,419 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-17 09:43:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-17 09:43:00,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-17 09:43:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:43:00,436 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-17 09:43:00,436 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-17 09:43:00,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2023-02-17 09:43:00,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:00,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:00,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:00,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-17 09:43:00,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-17 09:43:00,438 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-17 09:43:00,438 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-17 09:43:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-17 09:43:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603854571] [2023-02-17 09:43:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 1 times [2023-02-17 09:43:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322511780] [2023-02-17 09:43:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash 28699757, now seen corresponding path program 1 times [2023-02-17 09:43:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:00,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545594189] [2023-02-17 09:43:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:00,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:00,500 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:00,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:00,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:00,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:00,501 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:00,501 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,501 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:00,501 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:00,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-17 09:43:00,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:00,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:00,512 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-17 09:43:00,534 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-17 09:43:00,535 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-17 09:43:00,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:00,544 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:00,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,548 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-17 09:43:00,549 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-17 09:43:00,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:00,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:00,575 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:00,575 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-17 09:43:00,581 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-17 09:43:00,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,587 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-17 09:43:00,589 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-17 09:43:00,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:00,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:00,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:00,625 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-17 09:43:00,628 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-17 09:43:00,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,630 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-17 09:43:00,632 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-17 09:43:00,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:00,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:00,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,666 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-17 09:43:00,668 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-17 09:43:00,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:00,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:00,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:00,730 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-17 09:43:00,731 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:00,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:00,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:00,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:00,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:00,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:00,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:00,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-17 09:43:00,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:00,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:00,733 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-17 09:43:00,739 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-17 09:43:00,740 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-17 09:43:00,744 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:00,747 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:00,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,749 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-17 09:43:00,761 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-17 09:43:00,762 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-17 09:43:00,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:00,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:00,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:00,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:00,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:00,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:00,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:00,789 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-17 09:43:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,791 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-17 09:43:00,793 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-17 09:43:00,796 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-17 09:43:00,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:00,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:00,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:00,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:00,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:00,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:00,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:00,832 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-17 09:43:00,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,835 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-17 09:43:00,837 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-17 09:43:00,839 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-17 09:43:00,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:00,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:00,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:00,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:00,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:00,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:43:00,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:00,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:00,865 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-17 09:43:00,865 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:00,915 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-17 09:43:00,916 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-17 09:43:00,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:00,917 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:00,917 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:00,919 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-17 09:43:00,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:00,926 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:00,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:00,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:00,979 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:00,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:00,985 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-17 09:43:00,988 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-17 09:43:00,989 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-17 09:43:01,009 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-17 09:43:01,010 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-17 09:43:01,011 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-17 09:43:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-17 09:43:01,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2023-02-17 09:43:01,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2023-02-17 09:43:01,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-17 09:43:01,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2023-02-17 09:43:01,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-17 09:43:01,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2023-02-17 09:43:01,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-17 09:43:01,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-17 09:43:01,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2023-02-17 09:43:01,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:01,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-17 09:43:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2023-02-17 09:43:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-17 09:43:01,015 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-17 09:43:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-02-17 09:43:01,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-17 09:43:01,016 INFO L428 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-17 09:43:01,016 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-17 09:43:01,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2023-02-17 09:43:01,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-17 09:43:01,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:01,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:01,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:43:01,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:01,017 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-17 09:43:01,018 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-17 09:43:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 28699755, now seen corresponding path program 1 times [2023-02-17 09:43:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079284674] [2023-02-17 09:43:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 2 times [2023-02-17 09:43:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301046211] [2023-02-17 09:43:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1810661142, now seen corresponding path program 1 times [2023-02-17 09:43:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201462928] [2023-02-17 09:43:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:01,067 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-17 09:43:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201462928] [2023-02-17 09:43:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201462928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110032010] [2023-02-17 09:43:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,069 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-17 09:43:01,071 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-17 09:43:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:01,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:43:01,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:01,117 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-17 09:43:01,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:01,139 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-17 09:43:01,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110032010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:01,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:01,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-02-17 09:43:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59527350] [2023-02-17 09:43:01,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:43:01,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:43:01,142 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-17 09:43:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:01,189 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-17 09:43:01,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2023-02-17 09:43:01,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:01,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2023-02-17 09:43:01,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-17 09:43:01,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-17 09:43:01,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2023-02-17 09:43:01,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:01,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-17 09:43:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2023-02-17 09:43:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 09:43:01,198 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-17 09:43:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-02-17 09:43:01,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-17 09:43:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 09:43:01,202 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-17 09:43:01,202 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-17 09:43:01,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2023-02-17 09:43:01,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:01,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:01,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:01,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2023-02-17 09:43:01,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-17 09:43:01,205 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-17 09:43:01,205 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-17 09:43:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1805445589, now seen corresponding path program 1 times [2023-02-17 09:43:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808664490] [2023-02-17 09:43:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 2 times [2023-02-17 09:43:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817860099] [2023-02-17 09:43:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -154083067, now seen corresponding path program 2 times [2023-02-17 09:43:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592255975] [2023-02-17 09:43:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,271 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:01,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:01,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:01,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:01,271 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:01,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:01,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:01,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-17 09:43:01,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:01,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:01,273 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-17 09:43:01,274 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-17 09:43:01,275 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-17 09:43:01,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:01,278 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,281 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-17 09:43:01,325 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-17 09:43:01,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:01,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,365 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:01,365 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-17 09:43:01,387 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-17 09:43:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,400 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-17 09:43:01,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:01,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,414 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-17 09:43:01,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:01,432 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-17 09:43:01,436 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-17 09:43:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,438 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-17 09:43:01,440 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-17 09:43:01,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:01,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,488 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-17 09:43:01,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,490 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-17 09:43:01,491 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-17 09:43:01,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:01,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,528 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:01,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-02-17 09:43:01,532 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:01,532 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:01,533 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:01,533 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:01,533 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:01,533 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:01,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:01,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-17 09:43:01,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:01,533 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:01,534 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-17 09:43:01,536 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-17 09:43:01,539 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-17 09:43:01,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:01,542 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:01,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,547 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-17 09:43:01,548 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-17 09:43:01,550 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-17 09:43:01,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:01,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:01,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:01,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:01,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:01,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:01,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:01,591 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-17 09:43:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,597 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-17 09:43:01,598 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-17 09:43:01,601 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-17 09:43:01,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:01,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:01,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:01,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:01,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:01,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:01,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:01,649 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-17 09:43:01,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,650 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-17 09:43:01,669 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-17 09:43:01,670 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-17 09:43:01,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:01,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:01,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:01,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:01,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:01,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:43:01,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:01,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:01,704 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-17 09:43:01,704 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:01,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,716 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-17 09:43:01,736 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-17 09:43:01,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:01,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:01,737 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:01,737 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-17 09:43:01,741 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-17 09:43:01,741 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:01,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:01,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:01,772 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:01,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:01,784 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-17 09:43:01,785 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-17 09:43:01,785 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-17 09:43:01,798 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-17 09:43:01,799 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-17 09:43:01,799 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-17 09:43:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-17 09:43:01,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-17 09:43:01,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-17 09:43:01,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-17 09:43:01,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:01,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2023-02-17 09:43:01,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:01,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 44 transitions. [2023-02-17 09:43:01,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-17 09:43:01,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-17 09:43:01,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2023-02-17 09:43:01,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:01,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-17 09:43:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2023-02-17 09:43:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-02-17 09:43:01,810 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-17 09:43:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-02-17 09:43:01,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-17 09:43:01,811 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-17 09:43:01,812 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-17 09:43:01,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2023-02-17 09:43:01,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-17 09:43:01,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:01,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:01,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1] [2023-02-17 09:43:01,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-17 09:43:01,815 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-17 09:43:01,815 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-17 09:43:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1972849857, now seen corresponding path program 3 times [2023-02-17 09:43:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813549395] [2023-02-17 09:43:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,844 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-17 09:43:01,850 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-17 09:43:01,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 3 times [2023-02-17 09:43:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818209450] [2023-02-17 09:43:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 837622447, now seen corresponding path program 4 times [2023-02-17 09:43:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:01,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460241150] [2023-02-17 09:43:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:01,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:01,886 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:01,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:01,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:01,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:01,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:01,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:01,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:01,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-17 09:43:01,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:01,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:01,888 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-17 09:43:01,889 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-17 09:43:01,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-17 09:43:01,892 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:01,893 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,898 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-17 09:43:01,900 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-17 09:43:01,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:01,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,946 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:01,946 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-17 09:43:01,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:01,950 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-17 09:43:01,953 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-17 09:43:01,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:01,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:01,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:43:01,994 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-17 09:43:02,028 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-17 09:43:02,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,030 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-17 09:43:02,031 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-17 09:43:02,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:02,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:02,044 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-17 09:43:02,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,045 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-17 09:43:02,047 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-17 09:43:02,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:02,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:02,095 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:02,099 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-17 09:43:02,100 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:02,100 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:02,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:02,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:02,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:02,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:02,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:02,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-17 09:43:02,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:02,100 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:02,101 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-17 09:43:02,103 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-17 09:43:02,103 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-17 09:43:02,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:02,106 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:02,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,107 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-17 09:43:02,109 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-17 09:43:02,110 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-17 09:43:02,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:02,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:02,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:02,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:02,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:02,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:02,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:02,159 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-17 09:43:02,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,165 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-17 09:43:02,168 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-17 09:43:02,170 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-17 09:43:02,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:02,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:02,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:02,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:02,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:43:02,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:43:02,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:43:02,233 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-17 09:43:02,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,253 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-17 09:43:02,308 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-17 09:43:02,308 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-17 09:43:02,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:02,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:02,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:02,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:02,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:02,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:43:02,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:02,318 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:02,339 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-17 09:43:02,339 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,353 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-17 09:43:02,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:02,367 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:02,367 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:02,367 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-17 09:43:02,368 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-17 09:43:02,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-17 09:43:02,384 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,405 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,410 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-17 09:43:02,411 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-17 09:43:02,411 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-17 09:43:02,420 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-17 09:43:02,420 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-17 09:43:02,420 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-17 09:43:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-17 09:43:02,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-17 09:43:02,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:02,421 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:43:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,440 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,445 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-17 09:43:02,445 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-17 09:43:02,446 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-17 09:43:02,452 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-17 09:43:02,453 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-17 09:43:02,453 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-17 09:43:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-17 09:43:02,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-17 09:43:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:02,456 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:43:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,476 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,480 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-17 09:43:02,481 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-17 09:43:02,481 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-17 09:43:02,492 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-17 09:43:02,492 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-17 09:43:02,493 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-17 09:43:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-02-17 09:43:02,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-17 09:43:02,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:02,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 17 letters. Loop has 3 letters. [2023-02-17 09:43:02,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:02,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 6 letters. [2023-02-17 09:43:02,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:02,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2023-02-17 09:43:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-17 09:43:02,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 58 transitions. [2023-02-17 09:43:02,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-17 09:43:02,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-17 09:43:02,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2023-02-17 09:43:02,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:02,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-02-17 09:43:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2023-02-17 09:43:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-17 09:43:02,497 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-17 09:43:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-02-17 09:43:02,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-17 09:43:02,497 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-17 09:43:02,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-17 09:43:02,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2023-02-17 09:43:02,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-17 09:43:02,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:02,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:02,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1] [2023-02-17 09:43:02,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2023-02-17 09:43:02,499 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-17 09:43:02,499 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-17 09:43:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1031341869, now seen corresponding path program 5 times [2023-02-17 09:43:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718953502] [2023-02-17 09:43:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,543 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-17 09:43:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718953502] [2023-02-17 09:43:02,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718953502] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833376823] [2023-02-17 09:43:02,543 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:43:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,561 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-17 09:43:02,585 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-17 09:43:02,589 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-02-17 09:43:02,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:02,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,608 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-17 09:43:02,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:02,630 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-17 09:43:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833376823] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:02,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:02,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-17 09:43:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283501160] [2023-02-17 09:43:02,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:02,631 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1215871107, now seen corresponding path program 1 times [2023-02-17 09:43:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637872201] [2023-02-17 09:43:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:02,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:02,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:02,640 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:02,640 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:02,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:02,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:02,640 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:43:02,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:02,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:02,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-17 09:43:02,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:02,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:02,641 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-17 09:43:02,642 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-17 09:43:02,643 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-17 09:43:02,645 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:02,645 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:43:02,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,670 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-17 09:43:02,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:43:02,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:02,714 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-17 09:43:02,755 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-17 09:43:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,768 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-17 09:43:02,805 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-17 09:43:02,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:43:02,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:43:02,853 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:43:02,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-17 09:43:02,866 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:43:02,866 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:43:02,866 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:43:02,866 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:43:02,866 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:43:02,866 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:43:02,867 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:43:02,867 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-17 09:43:02,867 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:43:02,867 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:43:02,868 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-17 09:43:02,869 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-17 09:43:02,870 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-17 09:43:02,872 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:43:02,872 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:43:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,874 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-17 09:43:02,914 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-17 09:43:02,914 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-17 09:43:02,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:43:02,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:43:02,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:43:02,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:43:02,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:43:02,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:43:02,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:43:02,938 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:43:02,941 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:43:02,941 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:43:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:43:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:02,942 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-17 09:43:02,943 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-17 09:43:02,949 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:43:02,949 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:43:02,949 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:43:02,949 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-17 09:43:02,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-17 09:43:02,968 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:43:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:02,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 09:43:02,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:43:03,000 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-17 09:43:03,001 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-17 09:43:03,017 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 72 states and 96 transitions. Complement of second has 6 states. [2023-02-17 09:43:03,018 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-17 09:43:03,018 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-17 09:43:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-17 09:43:03,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-17 09:43:03,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:03,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 23 letters. Loop has 6 letters. [2023-02-17 09:43:03,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:03,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 17 letters. Loop has 12 letters. [2023-02-17 09:43:03,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:43:03,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2023-02-17 09:43:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:03,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 55 states and 73 transitions. [2023-02-17 09:43:03,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-17 09:43:03,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-02-17 09:43:03,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2023-02-17 09:43:03,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:03,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-02-17 09:43:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2023-02-17 09:43:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-02-17 09:43:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 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-17 09:43:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2023-02-17 09:43:03,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2023-02-17 09:43:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:43:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:43:03,025 INFO L87 Difference]: Start difference. First operand 47 states and 63 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-17 09:43:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:03,076 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2023-02-17 09:43:03,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 105 transitions. [2023-02-17 09:43:03,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:03,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 75 states and 91 transitions. [2023-02-17 09:43:03,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-02-17 09:43:03,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-17 09:43:03,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 91 transitions. [2023-02-17 09:43:03,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:03,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 91 transitions. [2023-02-17 09:43:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 91 transitions. [2023-02-17 09:43:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-02-17 09:43:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 70 states have internal predecessors, (87), 0 states have call successors, (0), 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-17 09:43:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2023-02-17 09:43:03,081 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 87 transitions. [2023-02-17 09:43:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 09:43:03,082 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2023-02-17 09:43:03,082 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-17 09:43:03,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 87 transitions. [2023-02-17 09:43:03,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:03,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:03,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:03,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 9, 2, 1, 1] [2023-02-17 09:43:03,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:03,084 INFO L748 eck$LassoCheckResult]: Stem: 1113#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1114#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; 1115#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1147#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1148#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1119#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1120#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1159#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1158#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1157#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1156#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1153#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1144#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1145#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1143#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1142#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1141#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1139#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1121#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1110#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1106#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1107#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1169#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1168#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1167#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1140#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1125#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1124#L12 [2023-02-17 09:43:03,084 INFO L750 eck$LassoCheckResult]: Loop: 1124#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1123#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1124#L12 [2023-02-17 09:43:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash -566648130, now seen corresponding path program 6 times [2023-02-17 09:43:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:03,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474000701] [2023-02-17 09:43:03,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:03,218 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-17 09:43:03,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:03,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474000701] [2023-02-17 09:43:03,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474000701] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:03,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397805203] [2023-02-17 09:43:03,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 09:43:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:03,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:03,241 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-17 09:43:03,277 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-17 09:43:03,283 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-17 09:43:03,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:03,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:43:03,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:03,326 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-17 09:43:03,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:03,398 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-17 09:43:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397805203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:03,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:03,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-17 09:43:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610038063] [2023-02-17 09:43:03,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:03,399 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1654, now seen corresponding path program 3 times [2023-02-17 09:43:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017596627] [2023-02-17 09:43:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:03,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:03,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:03,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:03,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 09:43:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=356, Unknown=0, NotChecked=0, Total=600 [2023-02-17 09:43:03,405 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. cyclomatic complexity: 22 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-17 09:43:03,509 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-17 09:43:03,527 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-17 09:43:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:03,568 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2023-02-17 09:43:03,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 167 transitions. [2023-02-17 09:43:03,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:03,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 123 states and 139 transitions. [2023-02-17 09:43:03,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-02-17 09:43:03,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-17 09:43:03,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 139 transitions. [2023-02-17 09:43:03,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:03,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 123 states and 139 transitions. [2023-02-17 09:43:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 139 transitions. [2023-02-17 09:43:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-02-17 09:43:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.134453781512605) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 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-17 09:43:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2023-02-17 09:43:03,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 135 transitions. [2023-02-17 09:43:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 09:43:03,575 INFO L428 stractBuchiCegarLoop]: Abstraction has 119 states and 135 transitions. [2023-02-17 09:43:03,575 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-17 09:43:03,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 135 transitions. [2023-02-17 09:43:03,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:03,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:03,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:03,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 23, 21, 2, 1, 1] [2023-02-17 09:43:03,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:03,580 INFO L748 eck$LassoCheckResult]: Stem: 1586#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1587#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; 1588#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1619#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1620#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1618#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1592#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1593#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1657#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1656#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1655#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1654#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1653#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1652#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1651#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1650#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1649#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1648#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1647#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1646#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1645#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1644#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1643#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1642#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1641#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1640#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1639#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1638#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1637#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1636#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1635#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1634#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1633#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1632#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1631#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1630#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1629#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1628#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1627#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1626#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1625#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1624#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1623#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1622#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1621#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1616#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1617#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1615#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1614#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1613#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1611#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1594#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1584#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1580#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1581#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1678#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1677#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1676#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1675#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1674#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1673#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1672#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1671#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1670#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1669#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1668#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1667#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1665#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1663#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1612#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1597#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1596#L12 [2023-02-17 09:43:03,580 INFO L750 eck$LassoCheckResult]: Loop: 1596#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1595#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1596#L12 [2023-02-17 09:43:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1262893886, now seen corresponding path program 7 times [2023-02-17 09:43:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:03,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209800988] [2023-02-17 09:43:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:03,803 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-17 09:43:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209800988] [2023-02-17 09:43:03,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209800988] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628334256] [2023-02-17 09:43:03,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 09:43:03,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:03,805 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:03,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-17 09:43:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:03,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 09:43:03,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:04,011 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-17 09:43:04,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:04,169 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-17 09:43:04,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628334256] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:04,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:04,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 38 [2023-02-17 09:43:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844472784] [2023-02-17 09:43:04,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:04,170 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1654, now seen corresponding path program 4 times [2023-02-17 09:43:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:04,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876520986] [2023-02-17 09:43:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 09:43:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 09:43:04,176 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. cyclomatic complexity: 22 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-17 09:43:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:04,328 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2023-02-17 09:43:04,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 236 transitions. [2023-02-17 09:43:04,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:04,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 186 states and 202 transitions. [2023-02-17 09:43:04,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-02-17 09:43:04,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-17 09:43:04,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 202 transitions. [2023-02-17 09:43:04,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:04,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 202 transitions. [2023-02-17 09:43:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 202 transitions. [2023-02-17 09:43:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-02-17 09:43:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.0879120879120878) internal successors, (198), 181 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:43:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2023-02-17 09:43:04,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 198 transitions. [2023-02-17 09:43:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-17 09:43:04,337 INFO L428 stractBuchiCegarLoop]: Abstraction has 182 states and 198 transitions. [2023-02-17 09:43:04,337 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-17 09:43:04,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 198 transitions. [2023-02-17 09:43:04,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-17 09:43:04,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:04,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:04,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 36, 34, 2, 1, 1] [2023-02-17 09:43:04,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:04,339 INFO L748 eck$LassoCheckResult]: Stem: 2401#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2402#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; 2403#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2409#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2398#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2399#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2477#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2394#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); 2527#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2526#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2525#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2524#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2522#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2521#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2520#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2519#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2518#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2517#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2516#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2515#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2514#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2513#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2512#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2511#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2510#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2509#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2508#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2507#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2506#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2505#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2504#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2503#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2502#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2501#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2500#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2499#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2498#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2497#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2496#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2495#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2494#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2493#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2492#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2491#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2490#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2489#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2488#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2487#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2486#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2485#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2484#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2483#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2482#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2481#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2480#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2479#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2478#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); 2432#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2428#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2426#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2425#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2407#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2408#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2475#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2474#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2473#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2472#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2471#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2470#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2469#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2468#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2467#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2466#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2465#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2464#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2463#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2462#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2461#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2460#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2459#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2458#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2457#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2456#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2455#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2454#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2453#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2452#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2451#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2450#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2449#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2448#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2447#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2446#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2445#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2444#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2443#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2442#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2441#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2440#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2439#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2438#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2436#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2437#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2433#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2430#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2410#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2411#L12 [2023-02-17 09:43:04,339 INFO L750 eck$LassoCheckResult]: Loop: 2411#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2413#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2411#L12 [2023-02-17 09:43:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1287581916, now seen corresponding path program 8 times [2023-02-17 09:43:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:04,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462647203] [2023-02-17 09:43:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1654, now seen corresponding path program 5 times [2023-02-17 09:43:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:04,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060074850] [2023-02-17 09:43:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:04,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -415639335, now seen corresponding path program 1 times [2023-02-17 09:43:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:04,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457853066] [2023-02-17 09:43:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:04,435 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-17 09:43:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:04,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457853066] [2023-02-17 09:43:04,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457853066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:43:04,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:43:04,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:43:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576445484] [2023-02-17 09:43:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:43:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:43:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:43:04,437 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. cyclomatic complexity: 22 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-17 09:43:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:04,447 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2023-02-17 09:43:04,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 192 transitions. [2023-02-17 09:43:04,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:04,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 132 states and 140 transitions. [2023-02-17 09:43:04,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-17 09:43:04,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-17 09:43:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 140 transitions. [2023-02-17 09:43:04,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:04,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 140 transitions. [2023-02-17 09:43:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 140 transitions. [2023-02-17 09:43:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2023-02-17 09:43:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.062015503875969) internal successors, (137), 128 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-17 09:43:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2023-02-17 09:43:04,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 137 transitions. [2023-02-17 09:43:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:43:04,452 INFO L428 stractBuchiCegarLoop]: Abstraction has 129 states and 137 transitions. [2023-02-17 09:43:04,452 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-17 09:43:04,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 137 transitions. [2023-02-17 09:43:04,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:04,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:04,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:04,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [38, 37, 34, 3, 1, 1, 1] [2023-02-17 09:43:04,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:04,453 INFO L748 eck$LassoCheckResult]: Stem: 2771#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2772#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; 2773#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2776#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2777#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2788#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2789#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2769#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2765#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2766#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2892#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2891#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2890#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2889#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2888#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2887#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2886#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2885#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2884#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2883#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2882#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2881#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2880#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2879#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2878#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2877#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2876#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2875#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2874#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2873#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2872#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2871#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2870#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2869#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2868#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2867#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2866#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2865#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2864#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2863#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2862#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2861#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2860#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2859#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2858#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2857#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2856#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2855#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2854#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2853#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2852#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2851#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2850#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2849#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2848#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2847#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2846#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2845#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2844#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2843#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2841#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2842#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2840#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2839#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2838#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2837#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2836#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2835#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2834#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2833#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2832#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2831#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2830#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2829#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2828#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2827#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2826#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2825#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2824#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2823#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2822#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2821#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2820#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2819#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2818#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2817#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2816#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2815#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2814#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2813#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2812#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2811#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2810#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2809#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2808#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2807#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2806#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2805#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2804#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2803#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2802#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2801#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2800#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2799#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2798#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2797#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2796#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2795#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2794#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2793#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 2792#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2790#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2787#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 2786#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2783#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2780#L12-1 [2023-02-17 09:43:04,456 INFO L750 eck$LassoCheckResult]: Loop: 2780#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2781#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 2780#L12-1 [2023-02-17 09:43:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2325394, now seen corresponding path program 2 times [2023-02-17 09:43:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:04,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931871612] [2023-02-17 09:43:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:04,741 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-17 09:43:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:04,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931871612] [2023-02-17 09:43:04,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931871612] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:04,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89986459] [2023-02-17 09:43:04,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:43:04,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:04,757 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-02-17 09:43:04,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:43:04,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:04,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 09:43:04,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:04,978 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-17 09:43:04,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:05,177 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-17 09:43:05,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89986459] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:05,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:05,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2023-02-17 09:43:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716674528] [2023-02-17 09:43:05,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:05,179 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 6 times [2023-02-17 09:43:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:05,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283265295] [2023-02-17 09:43:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:05,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:05,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-17 09:43:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1004, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 09:43:05,184 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. cyclomatic complexity: 12 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-17 09:43:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:05,790 INFO L93 Difference]: Finished difference Result 319 states and 329 transitions. [2023-02-17 09:43:05,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 329 transitions. [2023-02-17 09:43:05,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:05,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 251 states and 261 transitions. [2023-02-17 09:43:05,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-17 09:43:05,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-17 09:43:05,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 261 transitions. [2023-02-17 09:43:05,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:05,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 251 states and 261 transitions. [2023-02-17 09:43:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 261 transitions. [2023-02-17 09:43:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2023-02-17 09:43:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 243 states have (on average 1.0411522633744856) internal successors, (253), 242 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-17 09:43:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 253 transitions. [2023-02-17 09:43:05,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 243 states and 253 transitions. [2023-02-17 09:43:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-02-17 09:43:05,805 INFO L428 stractBuchiCegarLoop]: Abstraction has 243 states and 253 transitions. [2023-02-17 09:43:05,805 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-17 09:43:05,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 253 transitions. [2023-02-17 09:43:05,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:05,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:05,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:05,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [76, 75, 70, 5, 1, 1, 1] [2023-02-17 09:43:05,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:05,808 INFO L748 eck$LassoCheckResult]: Stem: 4022#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4023#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; 4024#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4028#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4041#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4017#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4257#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4256#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4255#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4254#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4253#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4252#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4251#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4250#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4249#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4248#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4247#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4246#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4245#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4244#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4243#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4242#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4241#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4240#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4239#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4238#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4237#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4236#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4235#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4234#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4233#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4232#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4231#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4230#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4229#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4228#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4227#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4226#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4225#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4224#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4223#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4222#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4221#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4220#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4219#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4218#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4217#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4216#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4215#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4214#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4213#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4212#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4211#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4210#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4209#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4208#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4206#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4207#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4205#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4204#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4203#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4202#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4201#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4200#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4199#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4198#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4197#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4196#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4195#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4194#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4193#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4192#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4191#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4190#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4189#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4188#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4187#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4186#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4185#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4184#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4183#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4182#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4181#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4180#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4179#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4178#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4177#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4176#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4175#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4174#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4173#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4172#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4171#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4170#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4169#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4168#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4167#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4166#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4165#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4164#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4163#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4162#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4161#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4160#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4159#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4158#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4157#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4156#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4155#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4154#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4153#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4152#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4151#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4149#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4148#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4147#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4146#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4145#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4144#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4143#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4142#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4141#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4140#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4139#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4138#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4137#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4136#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4135#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4134#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4133#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4132#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4131#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4130#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4129#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4128#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4127#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4126#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4125#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4124#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4123#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4122#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4121#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4120#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4119#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4118#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4117#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4116#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4115#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4114#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4113#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4112#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4111#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4110#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4109#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4108#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4107#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4106#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4105#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4104#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4103#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4102#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4101#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4100#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4099#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4098#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4097#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4096#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4094#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4093#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4092#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4091#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4090#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4089#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4088#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4087#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4086#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4085#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4084#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4083#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4082#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4081#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4080#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4079#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4078#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4077#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4076#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4075#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4074#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4073#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4072#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4071#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4070#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4069#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4068#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4067#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4066#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4065#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4064#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4063#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4062#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4061#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4060#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4059#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4054#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4053#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4051#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4050#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4048#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4047#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4043#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4042#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4039#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4038#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4033#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4029#L12-1 [2023-02-17 09:43:05,810 INFO L750 eck$LassoCheckResult]: Loop: 4029#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4030#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4029#L12-1 [2023-02-17 09:43:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1383057750, now seen corresponding path program 3 times [2023-02-17 09:43:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777807688] [2023-02-17 09:43:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:05,969 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-17 09:43:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777807688] [2023-02-17 09:43:05,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777807688] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113057364] [2023-02-17 09:43:05,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:43:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:05,998 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:05,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-17 09:43:06,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 09:43:06,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:06,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:43:06,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:06,059 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-17 09:43:06,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:06,089 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-17 09:43:06,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113057364] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:06,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:06,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-02-17 09:43:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089462188] [2023-02-17 09:43:06,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:06,090 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 7 times [2023-02-17 09:43:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:06,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623505388] [2023-02-17 09:43:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:06,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:06,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 09:43:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:43:06,094 INFO L87 Difference]: Start difference. First operand 243 states and 253 transitions. cyclomatic complexity: 16 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-17 09:43:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:06,245 INFO L93 Difference]: Finished difference Result 267 states and 282 transitions. [2023-02-17 09:43:06,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 282 transitions. [2023-02-17 09:43:06,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:06,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 267 states and 282 transitions. [2023-02-17 09:43:06,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-02-17 09:43:06,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-17 09:43:06,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 282 transitions. [2023-02-17 09:43:06,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:06,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 282 transitions. [2023-02-17 09:43:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 282 transitions. [2023-02-17 09:43:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2023-02-17 09:43:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 1.046875) internal successors, (268), 255 states have internal predecessors, (268), 0 states have call successors, (0), 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-17 09:43:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions. [2023-02-17 09:43:06,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 256 states and 268 transitions. [2023-02-17 09:43:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 09:43:06,252 INFO L428 stractBuchiCegarLoop]: Abstraction has 256 states and 268 transitions. [2023-02-17 09:43:06,252 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-17 09:43:06,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 268 transitions. [2023-02-17 09:43:06,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:06,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:06,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:06,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [78, 77, 71, 6, 1, 1, 1] [2023-02-17 09:43:06,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:06,255 INFO L748 eck$LassoCheckResult]: Stem: 5953#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5954#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; 5955#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5969#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5965#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 5960#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5959#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5948#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6200#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6199#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6198#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6197#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6196#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6195#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6194#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6193#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6192#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6191#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6190#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6189#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6188#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6187#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6186#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6185#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6184#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6183#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6182#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6181#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6180#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6179#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6178#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6177#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6176#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6175#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6174#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6173#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6172#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6171#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6170#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6169#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6168#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6167#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6166#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6165#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6164#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6163#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6162#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6161#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6160#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6159#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6158#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6157#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6156#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6155#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6154#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6153#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6152#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6151#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6149#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6148#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6147#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6146#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6145#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6144#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6143#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6142#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6141#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6140#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6139#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6138#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6137#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6136#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6135#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6134#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6133#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6132#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6131#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6130#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6129#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6128#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6127#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6126#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6125#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6124#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6123#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6122#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6121#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6120#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6119#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6118#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6117#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6116#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6115#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6114#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6113#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6112#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6111#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6110#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6109#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6108#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6107#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6106#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6105#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6104#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6103#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6102#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6101#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6100#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6099#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6098#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6097#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6096#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6095#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6094#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6093#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6091#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6090#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6089#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6088#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6087#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6086#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6085#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6084#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6083#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6082#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6081#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6080#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6079#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6078#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6077#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6076#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6075#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6074#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6073#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6072#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6071#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6070#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6069#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6068#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6067#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6066#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6065#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6064#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6063#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6062#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6061#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6060#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6059#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6054#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6053#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6051#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6050#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6048#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6047#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6045#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6043#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6042#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6041#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6038#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6039#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6036#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6035#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6034#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6033#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6032#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6030#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6029#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6028#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6026#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6017#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6009#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6005#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5996#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5987#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5988#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5984#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 5983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5977#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 5976#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5980#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5971#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 5970#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5966#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5963#L12-1 [2023-02-17 09:43:06,255 INFO L750 eck$LassoCheckResult]: Loop: 5963#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5964#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 5963#L12-1 [2023-02-17 09:43:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2031563884, now seen corresponding path program 4 times [2023-02-17 09:43:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701033932] [2023-02-17 09:43:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:06,431 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-17 09:43:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701033932] [2023-02-17 09:43:06,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701033932] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655840422] [2023-02-17 09:43:06,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:43:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:06,455 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:43:06,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-02-17 09:43:06,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:43:06,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:06,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 09:43:06,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:06,814 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-17 09:43:06,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:07,080 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-17 09:43:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655840422] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:07,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:07,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28, 28] total 50 [2023-02-17 09:43:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974638578] [2023-02-17 09:43:07,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:07,081 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 8 times [2023-02-17 09:43:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:07,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358516860] [2023-02-17 09:43:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:07,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 09:43:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=1767, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 09:43:07,091 INFO L87 Difference]: Start difference. First operand 256 states and 268 transitions. cyclomatic complexity: 19 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-17 09:43:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:08,678 INFO L93 Difference]: Finished difference Result 1034 states and 1149 transitions. [2023-02-17 09:43:08,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 1149 transitions. [2023-02-17 09:43:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:08,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 986 states and 1101 transitions. [2023-02-17 09:43:08,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-17 09:43:08,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-17 09:43:08,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 986 states and 1101 transitions. [2023-02-17 09:43:08,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:08,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 986 states and 1101 transitions. [2023-02-17 09:43:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states and 1101 transitions. [2023-02-17 09:43:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 693. [2023-02-17 09:43:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 693 states have (on average 1.1096681096681096) internal successors, (769), 692 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-17 09:43:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 769 transitions. [2023-02-17 09:43:08,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 693 states and 769 transitions. [2023-02-17 09:43:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2023-02-17 09:43:08,696 INFO L428 stractBuchiCegarLoop]: Abstraction has 693 states and 769 transitions. [2023-02-17 09:43:08,696 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-17 09:43:08,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 693 states and 769 transitions. [2023-02-17 09:43:08,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:08,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:08,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:08,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [95, 94, 83, 11, 1, 1, 1] [2023-02-17 09:43:08,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:08,701 INFO L748 eck$LassoCheckResult]: Stem: 9120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9121#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; 9122#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9126#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9117#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9118#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9124#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9125#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9112#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9113#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9529#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9528#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9527#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9526#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9525#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9523#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9522#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9520#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9519#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9518#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9517#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9516#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9515#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9514#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9511#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9494#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9493#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9491#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9490#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9489#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9487#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9486#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9485#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9484#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9483#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9482#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9481#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9480#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9477#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9478#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9476#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9475#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9474#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9473#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9472#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9471#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9470#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9469#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9468#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9467#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9466#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9465#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9464#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9463#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9462#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9461#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9460#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9459#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9458#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9457#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9456#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9455#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9454#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9453#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9452#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9451#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9450#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9449#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9448#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9447#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9446#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9445#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9444#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9443#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9442#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9441#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9440#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9439#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9438#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9437#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9436#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9435#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9434#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9433#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9432#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9431#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9430#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9429#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9428#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9426#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9425#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9424#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9423#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9422#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9421#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9420#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9418#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9417#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9416#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9415#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9414#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9413#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9412#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9411#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9410#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9409#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9408#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9407#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9406#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9405#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9404#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9403#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9402#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9401#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9400#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9399#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9398#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9397#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9396#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9395#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9394#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9393#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9392#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9391#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9390#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9389#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9388#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9387#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9386#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9385#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9384#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9383#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9382#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9381#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9380#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9379#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9378#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9377#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9376#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9375#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9374#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9373#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9372#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9371#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9370#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9369#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9368#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9367#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9366#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9365#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9363#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9362#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9361#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9360#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9359#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9358#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9357#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9356#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9355#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9354#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9353#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9352#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9351#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9350#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9349#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9348#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9347#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9346#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9345#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9344#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9343#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9342#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9340#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9338#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9336#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9334#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9332#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9330#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9328#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9326#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9324#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9322#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9320#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9318#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9316#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9314#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9312#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9310#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9308#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9285#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9286#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9304#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9302#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9300#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9279#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9277#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9278#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9273#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9274#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9235#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9289#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9266#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9265#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9264#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9263#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9262#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9229#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9226#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9223#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9220#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9217#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9213#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9211#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9210#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9209#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9208#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9196#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9190#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9189#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9188#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9187#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9185#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9186#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9195#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9184#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9178#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9176#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9175#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9174#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9173#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9170#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9168#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9169#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9171#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9163#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9162#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9158#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9156#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9159#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9157#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9150#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9147#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9138#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9145#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9143#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9142#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9141#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9140#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9139#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9137#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9136#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9134#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9133#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9132#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9127#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9128#L12-1 [2023-02-17 09:43:08,701 INFO L750 eck$LassoCheckResult]: Loop: 9128#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9131#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9128#L12-1 [2023-02-17 09:43:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2005033964, now seen corresponding path program 5 times [2023-02-17 09:43:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:08,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137430727] [2023-02-17 09:43:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:09,151 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-17 09:43:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137430727] [2023-02-17 09:43:09,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137430727] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024982999] [2023-02-17 09:43:09,151 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:43:09,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:09,193 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-17 09:43:09,217 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-17 09:43:09,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2023-02-17 09:43:09,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:09,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 09:43:09,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:09,606 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-17 09:43:09,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:09,767 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-17 09:43:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024982999] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:09,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:09,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 44 [2023-02-17 09:43:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177886578] [2023-02-17 09:43:09,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:09,768 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 9 times [2023-02-17 09:43:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:09,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273317886] [2023-02-17 09:43:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:09,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:09,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:09,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-17 09:43:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=1381, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 09:43:09,776 INFO L87 Difference]: Start difference. First operand 693 states and 769 transitions. cyclomatic complexity: 82 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-17 09:43:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:10,764 INFO L93 Difference]: Finished difference Result 1293 states and 1392 transitions. [2023-02-17 09:43:10,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 1392 transitions. [2023-02-17 09:43:10,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:10,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 1183 states and 1282 transitions. [2023-02-17 09:43:10,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-17 09:43:10,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-02-17 09:43:10,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1183 states and 1282 transitions. [2023-02-17 09:43:10,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:10,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1183 states and 1282 transitions. [2023-02-17 09:43:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states and 1282 transitions. [2023-02-17 09:43:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 528. [2023-02-17 09:43:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.0833333333333333) internal successors, (572), 527 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-17 09:43:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 572 transitions. [2023-02-17 09:43:10,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 572 transitions. [2023-02-17 09:43:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-02-17 09:43:10,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 528 states and 572 transitions. [2023-02-17 09:43:10,786 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-17 09:43:10,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 572 transitions. [2023-02-17 09:43:10,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:10,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:10,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:10,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [131, 130, 115, 15, 1, 1, 1] [2023-02-17 09:43:10,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:10,791 INFO L748 eck$LassoCheckResult]: Stem: 13035#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13036#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; 13037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13044#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13031#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13032#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13042#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13043#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13027#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13028#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13516#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13515#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13514#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13513#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13512#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13511#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13510#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13509#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13508#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13507#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13506#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13505#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13504#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13503#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13502#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13501#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13500#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13499#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13498#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13497#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13496#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13495#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13494#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13493#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13492#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13491#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13490#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13489#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13488#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13487#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13486#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13485#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13484#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13483#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13482#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13481#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13480#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13479#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13478#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13477#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13476#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13475#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13474#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13473#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13472#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13471#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13470#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13469#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13468#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13467#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13465#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13466#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13464#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13463#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13462#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13461#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13460#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13459#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13458#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13457#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13456#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13455#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13454#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13453#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13452#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13451#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13450#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13449#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13448#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13447#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13446#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13445#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13444#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13443#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13442#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13441#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13440#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13439#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13438#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13437#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13436#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13435#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13434#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13433#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13432#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13431#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13430#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13429#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13428#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13426#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13425#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13424#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13423#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13422#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13421#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13420#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13419#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13418#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13417#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13416#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13415#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13414#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13413#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13412#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13411#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13410#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13408#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13409#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13407#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13406#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13405#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13404#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13403#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13402#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13401#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13400#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13399#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13398#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13397#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13396#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13395#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13394#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13393#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13392#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13391#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13390#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13389#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13388#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13387#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13386#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13385#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13384#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13383#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13382#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13381#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13380#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13379#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13378#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13377#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13376#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13375#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13374#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13373#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13372#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13371#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13370#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13369#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13368#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13367#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13366#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13365#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13364#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13363#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13362#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13361#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13360#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13359#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13358#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13357#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13356#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13353#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13355#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13352#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13354#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13554#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13553#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13551#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13550#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13549#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13548#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13547#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13546#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13544#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13542#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13539#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13538#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13536#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13534#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13533#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13532#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13531#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13530#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13528#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13527#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13526#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13524#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13523#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13321#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13319#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13320#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13529#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13315#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13313#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13314#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13309#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13310#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13522#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13305#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13304#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13303#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13301#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13302#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13298#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13297#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13237#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13296#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13295#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13289#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13351#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13350#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13349#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13348#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13347#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13346#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13345#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13344#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13343#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13342#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13341#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13340#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13339#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13338#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13337#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13336#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13335#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13334#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13333#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13332#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13331#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13330#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13329#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13328#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13327#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13326#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13325#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13324#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13323#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13189#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13322#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13521#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13040#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13041#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13234#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13233#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13232#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13231#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13206#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13205#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13203#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13202#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13201#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13200#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13199#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13197#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13198#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13214#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13191#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13192#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13187#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13186#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13185#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13184#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13183#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13182#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13181#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13180#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13179#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13178#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13177#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13176#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13170#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13169#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13167#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13165#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13163#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13159#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13158#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13157#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13156#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13153#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13147#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13142#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13141#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13139#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13140#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13136#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13135#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13134#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13133#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13132#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13131#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13130#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13129#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13128#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13127#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13126#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13125#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13124#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13123#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13121#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13120#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13118#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13119#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13115#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13114#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13113#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13112#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13111#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13110#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13109#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13108#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13107#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13106#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13105#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13104#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13103#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13102#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13101#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13084#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13098#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13097#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13096#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13095#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13094#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13093#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13092#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13091#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13090#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13089#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13088#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13087#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13086#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13072#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13085#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13083#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13082#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13081#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13080#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13079#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13078#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13077#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13076#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13075#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13074#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13063#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13073#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13071#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13070#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13069#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13068#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13067#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13066#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13065#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13064#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13062#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13061#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13060#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13059#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13058#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 13055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13053#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13052#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 13051#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13048#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13047#L12-1 [2023-02-17 09:43:10,791 INFO L750 eck$LassoCheckResult]: Loop: 13047#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 13046#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 13047#L12-1 [2023-02-17 09:43:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1703910940, now seen corresponding path program 6 times [2023-02-17 09:43:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764218999] [2023-02-17 09:43:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:11,452 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-17 09:43:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:11,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764218999] [2023-02-17 09:43:11,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764218999] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:11,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063430200] [2023-02-17 09:43:11,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 09:43:11,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:11,475 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-17 09:43:11,476 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-17 09:43:11,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 81 check-sat command(s) [2023-02-17 09:43:11,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:11,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 09:43:11,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:11,765 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-17 09:43:11,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:11,913 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-17 09:43:11,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063430200] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:11,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:11,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 37 [2023-02-17 09:43:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128264910] [2023-02-17 09:43:11,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:11,915 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 10 times [2023-02-17 09:43:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19786339] [2023-02-17 09:43:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:11,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-17 09:43:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 09:43:11,922 INFO L87 Difference]: Start difference. First operand 528 states and 572 transitions. cyclomatic complexity: 50 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-17 09:43:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:13,171 INFO L93 Difference]: Finished difference Result 685 states and 727 transitions. [2023-02-17 09:43:13,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 685 states and 727 transitions. [2023-02-17 09:43:13,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:13,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 685 states to 639 states and 679 transitions. [2023-02-17 09:43:13,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-17 09:43:13,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-02-17 09:43:13,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 639 states and 679 transitions. [2023-02-17 09:43:13,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:13,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 639 states and 679 transitions. [2023-02-17 09:43:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states and 679 transitions. [2023-02-17 09:43:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 433. [2023-02-17 09:43:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 433 states have (on average 1.0277136258660509) internal successors, (445), 432 states have internal predecessors, (445), 0 states have call successors, (0), 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-17 09:43:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 445 transitions. [2023-02-17 09:43:13,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 433 states and 445 transitions. [2023-02-17 09:43:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-02-17 09:43:13,180 INFO L428 stractBuchiCegarLoop]: Abstraction has 433 states and 445 transitions. [2023-02-17 09:43:13,180 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-17 09:43:13,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 445 transitions. [2023-02-17 09:43:13,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:13,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:13,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:13,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [140, 140, 125, 15, 1, 1] [2023-02-17 09:43:13,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:13,186 INFO L748 eck$LassoCheckResult]: Stem: 16819#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 16820#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; 16821#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16959#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16957#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16952#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16813#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16814#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17244#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17243#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17242#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17241#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17240#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17239#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17238#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17237#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17236#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17235#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17234#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17233#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17232#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17231#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17230#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17229#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17228#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17227#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17226#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17225#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17224#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17223#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17222#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17221#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17220#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17219#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17218#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17217#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17216#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17214#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17213#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17212#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17211#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17210#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17209#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17208#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17207#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17206#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17205#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17204#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17203#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17202#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17201#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17200#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17199#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17198#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17197#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17196#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17195#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17193#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17194#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17192#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17191#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17190#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17189#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17188#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17187#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17186#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17185#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17184#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17183#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17182#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17181#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17180#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17179#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17178#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17177#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17176#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17175#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17174#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17173#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17172#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17171#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17170#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17169#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17168#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17167#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17166#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17165#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17164#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17163#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17162#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17161#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17160#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17159#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17158#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17157#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17156#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17155#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17154#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17153#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17152#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17151#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17150#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17149#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17148#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17147#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17146#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17145#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17144#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17143#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17142#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17141#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17140#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17139#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17138#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17136#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17137#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17135#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17134#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17133#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17132#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17131#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17130#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17129#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17128#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17127#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17126#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17125#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17124#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17123#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17122#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17121#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17120#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17119#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17118#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17117#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17116#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17115#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17114#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17113#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17112#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17111#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17110#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17109#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17108#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17107#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17106#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17105#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17104#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17103#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17102#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17101#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17098#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17097#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17094#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17093#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17091#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17090#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17089#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17088#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17087#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17086#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17085#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17084#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17082#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17083#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17081#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17080#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17079#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17078#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17077#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17076#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17075#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17074#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17073#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17072#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17071#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17070#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17069#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17068#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17067#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17066#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17065#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17064#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17063#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17062#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17061#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17060#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17059#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17058#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17057#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17056#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17055#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17054#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17053#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17052#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17051#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17050#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17049#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17048#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17047#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17046#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17045#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17044#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17043#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17042#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17041#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17040#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17039#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17038#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17037#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17036#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17035#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17034#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17033#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16949#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17032#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17029#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17028#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17027#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 17026#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17025#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17024#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17023#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17022#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17021#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17020#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17019#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17018#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17017#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17016#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17015#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17014#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17013#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17012#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17011#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17010#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17009#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17008#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17007#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17006#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17005#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17004#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17003#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 17002#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 17001#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 17000#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16999#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16998#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16948#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16947#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16946#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16945#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16944#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16943#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16942#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16941#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16940#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16939#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16938#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16937#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16936#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16935#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16934#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16933#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16932#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16931#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16930#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16929#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16928#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16927#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16926#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16925#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16924#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16923#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16922#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16921#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16892#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16920#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16918#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16917#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16916#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16915#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16914#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16913#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16912#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16911#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16910#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16909#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16908#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16907#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16906#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16905#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16904#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16903#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16902#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16901#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16900#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16899#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16898#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16897#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16896#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16895#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16894#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16868#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16893#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16891#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16890#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16889#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16888#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16887#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16886#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16885#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16884#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16883#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16882#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16881#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16880#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16879#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16878#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16877#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16876#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16875#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16874#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16873#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16872#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16871#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16870#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16847#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16869#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16867#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16866#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16865#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16864#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16863#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16862#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16861#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16860#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16859#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16858#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16857#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16856#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16855#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16854#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16853#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16852#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16851#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16850#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16849#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16828#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16848#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16846#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16845#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16844#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16843#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16842#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16841#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16840#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16839#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16838#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16837#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16836#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16835#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16834#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16833#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16832#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16831#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16830#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16829#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16827#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16825#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16816#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16817#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16826#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16997#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16996#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16995#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16994#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16993#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16992#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16991#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16990#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16989#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16988#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16987#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16986#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16985#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16984#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16983#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16982#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16981#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16980#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16979#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16978#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16977#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16976#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16975#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16974#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16973#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16972#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16971#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16970#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16969#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16968#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16967#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16966#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16965#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16964#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16960#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16958#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 16956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16954#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16950#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 16951#L12-1 [2023-02-17 09:43:13,186 INFO L750 eck$LassoCheckResult]: Loop: 16951#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 16953#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 16951#L12-1 [2023-02-17 09:43:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1848898559, now seen corresponding path program 9 times [2023-02-17 09:43:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:13,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585326584] [2023-02-17 09:43:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:13,646 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-17 09:43:13,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:13,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585326584] [2023-02-17 09:43:13,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585326584] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:13,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416895596] [2023-02-17 09:43:13,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:43:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:13,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:13,659 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-17 09:43:13,707 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-17 09:43:13,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 117 check-sat command(s) [2023-02-17 09:43:13,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:13,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 09:43:13,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:14,222 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-17 09:43:14,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:14,548 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-17 09:43:14,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416895596] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:14,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:14,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 44 [2023-02-17 09:43:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554266136] [2023-02-17 09:43:14,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:14,549 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 11 times [2023-02-17 09:43:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:14,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238950916] [2023-02-17 09:43:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:14,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:14,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-17 09:43:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 09:43:14,556 INFO L87 Difference]: Start difference. First operand 433 states and 445 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-17 09:43:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:17,874 INFO L93 Difference]: Finished difference Result 745 states and 781 transitions. [2023-02-17 09:43:17,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 745 states and 781 transitions. [2023-02-17 09:43:17,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:17,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 745 states to 710 states and 746 transitions. [2023-02-17 09:43:17,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-02-17 09:43:17,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-02-17 09:43:17,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 710 states and 746 transitions. [2023-02-17 09:43:17,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:17,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 710 states and 746 transitions. [2023-02-17 09:43:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states and 746 transitions. [2023-02-17 09:43:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 613. [2023-02-17 09:43:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 613 states have (on average 1.030995106035889) internal successors, (632), 612 states have internal predecessors, (632), 0 states have call successors, (0), 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-17 09:43:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 632 transitions. [2023-02-17 09:43:17,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 613 states and 632 transitions. [2023-02-17 09:43:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2023-02-17 09:43:17,886 INFO L428 stractBuchiCegarLoop]: Abstraction has 613 states and 632 transitions. [2023-02-17 09:43:17,886 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-17 09:43:17,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 613 states and 632 transitions. [2023-02-17 09:43:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:17,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:17,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:17,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [161, 161, 144, 17, 1, 1] [2023-02-17 09:43:17,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:17,893 INFO L748 eck$LassoCheckResult]: Stem: 20914#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20915#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; 20916#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20950#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20949#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20948#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20946#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20943#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20906#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20907#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21514#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21511#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21494#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21493#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21491#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21490#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21489#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21487#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21486#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21485#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21484#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21483#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21482#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21481#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21480#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21479#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21478#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21477#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21475#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21474#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21473#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21472#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21471#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21470#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21469#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21468#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21467#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21466#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21465#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21463#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21464#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21462#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21461#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21460#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21459#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21458#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21457#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21456#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21455#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21454#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21453#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21452#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21451#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21450#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21449#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21448#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21447#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21446#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21445#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21444#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21443#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21442#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21441#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21440#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21439#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21438#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21437#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21436#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21435#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21434#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21433#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21432#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21431#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21430#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21429#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21428#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21427#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21426#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21425#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21424#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21423#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21422#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21421#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21420#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21419#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21418#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21417#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21416#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21415#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21414#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21413#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21412#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21411#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21410#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21409#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21408#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21406#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21407#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21405#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21404#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21403#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21402#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21401#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21400#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21399#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21398#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21397#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21396#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21395#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21394#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21393#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21392#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21391#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21390#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21389#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21388#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21387#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21386#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21385#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21384#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21383#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21382#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21381#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21380#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21379#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21378#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21377#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21376#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21375#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21374#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21373#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21372#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21371#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21370#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21369#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21368#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21367#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21366#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21365#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21364#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21363#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21362#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21361#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21360#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21359#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21358#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21357#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21356#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21355#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21354#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21352#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21353#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21351#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21350#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21349#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21348#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21347#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21346#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21345#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21344#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21343#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21342#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21341#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21340#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21339#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21338#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21337#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21336#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21335#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21334#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21333#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21332#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21331#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21330#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21329#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21328#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21327#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21326#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21325#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21324#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21323#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21322#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21321#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21320#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21319#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21318#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21317#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21316#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21315#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21314#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21313#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21312#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21311#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21309#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21308#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21307#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21306#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21305#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21304#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21303#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21301#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21302#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21300#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21299#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21298#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21297#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21296#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21295#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21294#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21293#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21292#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21291#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21290#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21289#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21288#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21287#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21286#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21285#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21284#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21283#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21282#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21281#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21280#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21279#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21278#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21277#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21276#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21275#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21274#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21273#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21272#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21271#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21270#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21269#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21268#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21267#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21266#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21265#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21264#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21263#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21262#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21261#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21171#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21172#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21170#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21169#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21168#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21167#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21166#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21165#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21163#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21162#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21161#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21160#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21159#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21158#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21157#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21156#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21155#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21154#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21153#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21152#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21151#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21150#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21149#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21147#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21145#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21144#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21143#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21142#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21141#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21140#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21139#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21138#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21136#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21135#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21134#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21133#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21132#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21131#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21130#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21129#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21128#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21127#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21126#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21125#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21124#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21123#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21122#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21121#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21120#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21119#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21118#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21117#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21116#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21115#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21114#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21113#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21112#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21111#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21110#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21109#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21108#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21107#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21105#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21104#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21103#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21102#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21101#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21098#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21097#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21094#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21093#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21091#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21090#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21089#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21088#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21087#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21086#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21085#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21084#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21083#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21082#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21081#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21080#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21079#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21078#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21077#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21076#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21075#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21074#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21073#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21072#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21071#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21070#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21069#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21068#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21067#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21066#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21065#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21064#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21063#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21062#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21061#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21060#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21059#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21058#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21053#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21051#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21047#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21045#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21043#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21041#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21039#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21035#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21033#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21029#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21027#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21023#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21021#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21017#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21015#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21014#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21013#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21012#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21011#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21005#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20996#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20921#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20988#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20939#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20938#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20937#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20936#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20935#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20934#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20933#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20932#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20931#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20930#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20929#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20928#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20927#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20926#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20925#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20924#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20923#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20922#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20920#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20918#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20911#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20912#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20987#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20984#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20981#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20979#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20978#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20975#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20969#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20967#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20966#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20963#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20958#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20957#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20954#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20945#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20941#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20942#L12-1 [2023-02-17 09:43:17,893 INFO L750 eck$LassoCheckResult]: Loop: 20942#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20944#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20942#L12-1 [2023-02-17 09:43:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2044987687, now seen corresponding path program 10 times [2023-02-17 09:43:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:17,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242510096] [2023-02-17 09:43:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:18,401 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-17 09:43:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:18,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242510096] [2023-02-17 09:43:18,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242510096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:18,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287338778] [2023-02-17 09:43:18,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:43:18,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:18,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:18,415 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-17 09:43:18,445 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-17 09:43:18,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:43:18,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:18,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-17 09:43:18,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:19,050 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-17 09:43:19,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:19,492 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-17 09:43:19,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287338778] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:19,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 40, 40] total 57 [2023-02-17 09:43:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694844399] [2023-02-17 09:43:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:19,494 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:43:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 12 times [2023-02-17 09:43:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:19,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641241697] [2023-02-17 09:43:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:19,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:19,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-17 09:43:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=2542, Unknown=0, NotChecked=0, Total=3192 [2023-02-17 09:43:19,500 INFO L87 Difference]: Start difference. First operand 613 states and 632 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-17 09:43:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:24,158 INFO L93 Difference]: Finished difference Result 1366 states and 1422 transitions. [2023-02-17 09:43:24,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1366 states and 1422 transitions. [2023-02-17 09:43:24,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:24,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1366 states to 1286 states and 1342 transitions. [2023-02-17 09:43:24,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2023-02-17 09:43:24,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2023-02-17 09:43:24,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1286 states and 1342 transitions. [2023-02-17 09:43:24,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:43:24,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 1342 transitions. [2023-02-17 09:43:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 1342 transitions. [2023-02-17 09:43:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 643. [2023-02-17 09:43:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 643 states have (on average 1.026438569206843) internal successors, (660), 642 states have internal predecessors, (660), 0 states have call successors, (0), 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-17 09:43:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 660 transitions. [2023-02-17 09:43:24,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 643 states and 660 transitions. [2023-02-17 09:43:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2023-02-17 09:43:24,200 INFO L428 stractBuchiCegarLoop]: Abstraction has 643 states and 660 transitions. [2023-02-17 09:43:24,200 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-17 09:43:24,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 643 states and 660 transitions. [2023-02-17 09:43:24,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-17 09:43:24,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:43:24,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:43:24,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [210, 210, 190, 20, 1, 1] [2023-02-17 09:43:24,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-17 09:43:24,206 INFO L748 eck$LassoCheckResult]: Stem: 26509#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 26510#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; 26511#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26547#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26546#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26545#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26540#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26502#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27139#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27138#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27137#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27136#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27135#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27134#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27133#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27132#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27131#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27130#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27129#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27128#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27127#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27126#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27125#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27124#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27123#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27122#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27121#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27120#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27119#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27118#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27117#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27116#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27115#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27114#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27113#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27112#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27111#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27110#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27109#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27108#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27107#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27106#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27105#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27104#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27103#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27102#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27101#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27100#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27099#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27098#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27097#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27096#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27095#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27094#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27093#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27092#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27091#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27090#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27032#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27089#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27088#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27087#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27086#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27085#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27084#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27083#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27082#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27081#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27080#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27079#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27078#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27077#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27076#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27075#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27074#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27073#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27072#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27071#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27070#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27069#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27068#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27067#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27066#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27065#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27064#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27063#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27062#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27061#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27060#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27059#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27054#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27053#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27051#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27050#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27048#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27047#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27045#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27043#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27042#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27041#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27039#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27038#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27036#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27035#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27034#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26978#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27033#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27030#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27029#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 27028#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27026#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27017#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27009#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27006#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27005#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 27002#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 27001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 27000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26996#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26988#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26987#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26984#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26981#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26927#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26979#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26975#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26969#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26967#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26966#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26963#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26958#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26957#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26954#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26950#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26949#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26948#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26946#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26945#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26944#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26943#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26942#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26941#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26940#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26939#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26938#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26937#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26936#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26935#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26934#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26933#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26932#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26931#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26930#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26929#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26879#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26928#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26926#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26925#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26924#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26923#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26922#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26921#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26920#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26918#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26917#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26916#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26915#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26914#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26913#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26912#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26911#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26910#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26909#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26908#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26907#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26906#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26905#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26904#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26903#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26902#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26901#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26900#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26899#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26898#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26897#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26896#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26895#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26894#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26893#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26892#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26891#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26890#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26889#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26888#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26887#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26886#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26885#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26884#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26883#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26882#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26881#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26834#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26880#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26878#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26877#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26876#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26875#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26874#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26873#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26872#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26871#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26870#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26869#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26868#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26866#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26865#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26864#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26863#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26862#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26861#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26860#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26859#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26858#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26857#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26856#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26855#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26854#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26853#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26852#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26851#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26850#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26849#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26848#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26847#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26846#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26845#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26844#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26843#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26842#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26841#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26840#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26839#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26838#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26837#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26836#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26792#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26835#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26833#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26832#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26831#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26830#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26829#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26828#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26827#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26826#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26825#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26824#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26823#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26822#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26821#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26820#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26819#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26818#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26817#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26816#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26815#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26814#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26813#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26812#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26811#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26810#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26809#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26808#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26807#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26806#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26805#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26804#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26803#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26802#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26801#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26800#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26799#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26798#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26797#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26796#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26795#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26794#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26753#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26793#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26791#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26790#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26789#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26788#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26787#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26786#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26785#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26784#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26783#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26782#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26781#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26780#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26779#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26778#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26777#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26776#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26775#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26774#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26773#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26772#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26771#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26770#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26769#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26768#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26767#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26766#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26765#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26764#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26763#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26762#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26761#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26760#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26759#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26758#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26757#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26756#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26755#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26717#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26754#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26752#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26751#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26750#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26749#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26748#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26747#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26746#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26745#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26744#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26743#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26742#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26741#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26740#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26739#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26738#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26737#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26736#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26735#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26734#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26733#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26732#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26731#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26730#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26729#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26728#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26727#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26726#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26725#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26724#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26723#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26722#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26721#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26720#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26719#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26718#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26716#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26715#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26714#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26713#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26712#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26711#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26710#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26709#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26708#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26707#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26706#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26705#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26704#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26703#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26702#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26701#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26700#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26699#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26698#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26697#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26696#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26695#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26694#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26693#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26692#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26691#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26690#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26689#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26688#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26687#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26686#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26654#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26685#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26683#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26682#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26681#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26680#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26679#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26678#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26677#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26676#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26675#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26674#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26673#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26672#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26671#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26670#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26669#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26668#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26667#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26666#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26665#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26664#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26663#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26662#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26661#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26660#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26659#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26658#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26657#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26656#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26627#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26655#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26653#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26652#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26651#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26650#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26649#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26648#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26647#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26646#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26645#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26644#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26643#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26642#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26641#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26640#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26639#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26638#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26637#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26636#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26635#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26634#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26633#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26632#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26631#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26630#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26629#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26603#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26628#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26626#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26625#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26624#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26623#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26622#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26621#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26620#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26619#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26618#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26617#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26616#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26615#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26614#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26613#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26612#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26611#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26610#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26609#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26608#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26607#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26606#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26605#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26536#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26604#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26602#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26601#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26600#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26599#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26598#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26597#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26596#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26595#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26594#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26593#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26592#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26591#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26590#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26589#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26588#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26587#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26586#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26585#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26584#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26517#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26537#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26534#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26533#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26532#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26531#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26530#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26529#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26528#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26527#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26526#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26525#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26524#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26522#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26521#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26520#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26519#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26518#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26515#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26516#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26583#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26514#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26513#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26506#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26582#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26581#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26580#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26579#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26578#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26577#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26576#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26575#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26574#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26573#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26572#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26571#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26570#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26569#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26568#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26567#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26566#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26564#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26563#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26562#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26561#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26560#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26559#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26558#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26557#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26556#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26555#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26554#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26553#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26551#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26550#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26549#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26548#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 26544#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26538#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 26539#L12-1 [2023-02-17 09:43:24,206 INFO L750 eck$LassoCheckResult]: Loop: 26539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 26541#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 26539#L12-1 [2023-02-17 09:43:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -686017405, now seen corresponding path program 11 times [2023-02-17 09:43:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245689353] [2023-02-17 09:43:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 13 times [2023-02-17 09:43:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:24,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997359233] [2023-02-17 09:43:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:43:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2132729554, now seen corresponding path program 7 times [2023-02-17 09:43:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:43:24,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565365023] [2023-02-17 09:43:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:43:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:43:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:24,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:43:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:25,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:43:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:43:26,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 09:43:26 BoogieIcfgContainer [2023-02-17 09:43:26,020 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-17 09:43:26,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:43:26,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:43:26,021 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:43:26,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:43:00" (3/4) ... [2023-02-17 09:43:26,023 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-17 09:43:26,124 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:43:26,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:43:26,124 INFO L158 Benchmark]: Toolchain (without parser) took 26468.16ms. Allocated memory was 138.4MB in the beginning and 536.9MB in the end (delta: 398.5MB). Free memory was 70.6MB in the beginning and 247.0MB in the end (delta: -176.4MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,124 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:26,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.66ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 70.4MB in the beginning and 143.8MB in the end (delta: -73.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.37ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 142.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,125 INFO L158 Benchmark]: Boogie Preprocessor took 11.98ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 141.7MB in the end (delta: 630.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:26,125 INFO L158 Benchmark]: RCFGBuilder took 175.66ms. Allocated memory is still 176.2MB. Free memory was 141.7MB in the beginning and 132.6MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,125 INFO L158 Benchmark]: BuchiAutomizer took 26006.37ms. Allocated memory was 176.2MB in the beginning and 536.9MB in the end (delta: 360.7MB). Free memory was 132.6MB in the beginning and 265.9MB in the end (delta: -133.3MB). Peak memory consumption was 226.0MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,126 INFO L158 Benchmark]: Witness Printer took 103.00ms. Allocated memory is still 536.9MB. Free memory was 265.9MB in the beginning and 247.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-17 09:43:26,127 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.14ms. Allocated memory is still 138.4MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.66ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 70.4MB in the beginning and 143.8MB in the end (delta: -73.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.37ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 142.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.98ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 141.7MB in the end (delta: 630.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 175.66ms. Allocated memory is still 176.2MB. Free memory was 141.7MB in the beginning and 132.6MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 26006.37ms. Allocated memory was 176.2MB in the beginning and 536.9MB in the end (delta: 360.7MB). Free memory was 132.6MB in the beginning and 265.9MB in the end (delta: -133.3MB). Peak memory consumption was 226.0MB. Max. memory is 16.1GB. * Witness Printer took 103.00ms. Allocated memory is still 536.9MB. Free memory was 265.9MB in the beginning and 247.0MB in the end (delta: 18.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 17 terminating modules (13 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function range + -1 * i 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. 13 modules have a trivial ranking function, the largest among these consists of 57 locations. The remainder module has 643 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.7s and 17 iterations. TraceHistogramMax:210. Analysis of lassos took 12.0s. Construction of modules took 2.8s. Büchi inclusion checks took 10.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1956 StatesRemovedByMinimization, 14 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, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 285 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 1096 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6776 IncrementalHoareTripleChecker+Invalid, 7872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1096 mSolverCounterUnsat, 69 mSDtfsCounter, 6776 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc3 concLT0 SILN9 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax139 hnf100 lsp72 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf96 smp100 dnf51 smp100 tf107 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 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-17 09:43:26,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-02-17 09:43:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:26,640 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-17 09:43:26,840 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-17 09:43:27,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:27,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:27,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:27,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-17 09:43:27,842 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-17 09:43:28,041 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-17 09:43:28,240 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-17 09:43:28,445 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)